Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 101-111
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Interpolating between Random Walks and Shortest Paths: A Path Functional ApproachLecture Notes in Computer Science, 2012
- Commute times for a directed graph using an asymmetric LaplacianLinear Algebra and its Applications, 2011
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distancesDiscrete Applied Mathematics, 2011
- Euclidean Distances, Soft and Spectral Clustering on Weighted GraphsLecture Notes in Computer Science, 2010
- Encyclopedia of Distances2009
- On the concept of equal exchangeSystems Research and Behavioral Science, 2007
- Markov AssociativitiesJournal of Quantitative Linguistics, 2005
- Geometry of Cuts and Metrics1997
- The partial order by inclusion of the principal classes of dissimilarity on a finite set, and some of their basic properties1994
- The electrical resistance of a graph captures its commute and cover times1989