A Generalized Distance in Graphs and Centered Partitions

DOI10.1137/S089548019426303XMaRDI QIDQ4388995zbMATH OpenFDO

Authors Cristian Lenart

Publication date 11 May 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S089548019426303X

zbMATH Keywords

centered partitionchain distanceclusteringgeneralized distanceHeyting semigroupminimum centered forestsemiring

Mathematics Subject Classification ID

Distance in graphs (05C12) Ordered semigroups and monoids (06F05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Distances in graph partitioning
• An algorithm on some shortest path of dendrogram
• On the intercluster distance of a tree metric
• The bases of weighted graphs
• Partition-distance: A problem and class of perfect graphs arising in clustering

Cited in

(9)

• The bases of weighted graphs
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Similarities on graphs: kernels versus proximity measures
• Distances of centroid sets in a graph-based construction for information security applications
• Distances in graph partitioning
• An algorithm on some shortest path of dendrogram
• On cent-dians of general networks
• Geometry of graph partitions via optimal transport
• scientific article; zbMATH DE number 2208163 (Why is no real title available?)

This page was built for publication: A Generalized Distance in Graphs and Centered Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388995)