Transfer distance between partitions and search of dense zones in graphs

DOI10.1007/S10288-008-0093-5MaRDI QIDQ976980zbMATH OpenOpenAlexFDO

Authors 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

combinatorial optimizationcombinatoricspartitionoverlapping clusteringbiologygraph partitioninginteractions between proteinstransfer distance

Mathematics Subject Classification ID

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

Recommendations

• Transfer distance between partitions
• Maximum of the transfer distance to a given partition
• Maximum transfer distance between partitions
• Distances in graph partitioning
• Partition-distance: A problem and class of perfect graphs arising in clustering

Cites work

• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• Maximum of the transfer distance to a given partition
• Maximum transfer distance between partitions
• Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks
• The complexity of computing metric distances between partitions
• Transfer distance between partitions

Cited in

(4)

• Distances in graph partitioning
• Algorithms for some graph theoretical optimization problems (abstract of thesis)
• Maximum of the transfer distance to a given partition
• Transfer distance between partitions

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

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