Distances in graph partitioning

MaRDI QIDQ2912424zbMATH OpenFDO

Authors Alain Guénoche

Publication date 14 September 2012

zbMATH Keywords

Czekanowski-Dice distanceErdős-Renyi multi-class modelPons-Latapy distancesparse biological graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20)

Recommendations

• Two local dissimilarity measures for weighted graphs with application to protein interaction networks
• A Generalized Distance in Graphs and Centered Partitions
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Comparison of algorithms in graph partitioning
• Transfer distance between partitions and search of dense zones in graphs

Cited in

(6)

• Partition-distance: A problem and class of perfect graphs arising in clustering
• Do logarithmic proximity measures outperform plain ones in graph clustering?
• A Generalized Distance in Graphs and Centered Partitions
• Network distances for weighted digraphs
• Bootstrap clustering for graph partitioning
• Transfer distance between partitions and search of dense zones in graphs

This page was built for publication: Distances in graph partitioning

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