Transfer distance between partitions and search of dense zones in graphs

DOI10.1007/s10288-008-0093-5zbMath1188.05020OpenAlexW1968000094MaRDI QIDQ976980

Lucile Denœud-Belgacem

Publication date: 16 June 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-008-0093-5

zbMATH Keywords

combinatoricspartitioncombinatorial optimizationgraph partitioningbiologyoverlapping clusteringinteractions between proteinstransfer distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Partitions of sets (05A18) Combinatorial optimization (90C27) General biology and biomathematics (92B05) Extremal combinatorics (05D99) Density (toughness, etc.) (05C42)

Cites Work

• Maximum transfer distance between partitions
• The complexity of computing metric distances between partitions
• Transfer distance between partitions
• Maximum de la distance de transfert à une partition donnée
• Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks
• Unnamed Item

This page was built for publication: Transfer distance between partitions and search of dense zones in graphs