Abstract
In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them featuring the cutpoint additive distances. These include the path distances, the reliability distance, the walk distances, and the logarithmic forest distances among others. We discuss a number of connections between these and other distances. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Chebotarev, P. (2013). Studying new classes of graph metrics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8085 LNCS, pp. 207–214). https://doi.org/10.1007/978-3-642-40020-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
