Comparing recent methods in graph partitioning

DOI10.1016/J.ENDM.2005.06.015zbMATH Open1182.05096OpenAlexW1965781107MaRDI QIDQ3439313FDOQ3439313

Authors: Alain Guénoche 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.015

Recommendations

• Comparison of algorithms in graph partitioning
• scientific article; zbMATH DE number 3855168
• scientific article; zbMATH DE number 3855167
• scientific article; zbMATH DE number 5761786
• Max Cut for Random Graphs with a Planted Partition

zbMATH Keywords

optimizationsimulationgraph partitioningdensity function

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Community structure in social and biological networks
• Recent directions in netlist partitioning: a survey

Cited In (9)

• An Updated Experimental Evaluation of Graph Bipartization Methods
• Title not available (Why is that?)
• Graph partitioning: an updated survey
• Bootstrap clustering for graph partitioning
• Comparison of algorithms in graph partitioning
• Title not available (Why is that?)
• Linear clustering process on networks: a comparative study
• Transfer distance between partitions
• Two local dissimilarity measures for weighted graphs with application to protein interaction networks

Uses Software

• MCODE

This page was built for publication: Comparing recent methods in graph partitioning

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