arXiv · 2008.00569
On Frink's type metrization of weighted graphs
Abstract
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted undirected graph.
Explore related subjects
Keep this discovery
María Florencia Acosta, Hugo Aimar, Ivana Gómez. 2020-08-02. On Frink's type metrization of weighted graphs. https://arxiv.org/abs/2008.00569
Cite the original work for its findings. Save a collection to share your selection of sources.