Comparison of algorithms in graph partitioning

DOI10.1051/ro:2008029zbMath1198.90379OpenAlexW2005769680MaRDI QIDQ3163669

Alain Guénoche

Publication date: 26 October 2010

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105415

zbMATH Keywords

simulationgraph partitioningpartition comparison

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Combining monte carlo estimates and bounds for network reliability ⋮ Bootstrap clustering for graph partitioning ⋮ Two local dissimilarity measures for weighted graphs with application to protein interaction networks

Uses Software

• MCODE

Cites Work

• Maximum transfer distance between partitions
• The complexity of computing metric distances between partitions
• Recent directions in netlist partitioning: a survey
• Community structure in social and biological networks
• Computing Communities in Large Networks Using Random Walks

This page was built for publication: Comparison of algorithms in graph partitioning