Comparison of algorithms in graph partitioning

DOI10.1051/RO:2008029MaRDI QIDQ3163669zbMATH OpenOpenAlexFDO

Authors 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, https://semanticscholar.org/paper/00527f8648aff8d9fce0515a523c7af068e2998c

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)

Recommendations

• Comparing recent methods in graph partitioning
• scientific article; zbMATH DE number 4094840
• A computational study of graph partitioning
• Efficient algorithms for a graph partitioning problem
• scientific article; zbMATH DE number 1942408
• scientific article; zbMATH DE number 4011955
• Algorithms for partition of some class of graphs under compaction
• An algorithm for improving graph partitions
• An exact algorithm for graph partitioning
• Approximation Algorithms for Some Graph Partitioning Problems

Cites work

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

Cited in

(19)

• Clustering algorithm of graphs
• scientific article; zbMATH DE number 3970751 (Why is no real title available?)
• scientific article; zbMATH DE number 3922710 (Why is no real title available?)
• scientific article; zbMATH DE number 3855167 (Why is no real title available?)
• scientific article; zbMATH DE number 3855168 (Why is no real title available?)
• Distances in graph partitioning
• Optimal Fuzzy Aggregation of Networks
• Graph-Based Representations in Pattern Recognition
• Bootstrap clustering for graph partitioning
• Combining monte carlo estimates and bounds for network reliability
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• Comparing recent methods in graph partitioning
• Linear clustering process on networks: a comparative study
• Looking for High Density Zones in a Graph
• A partitional clustering algorithm validated by a clustering tendency index based on graph theory
• Molecular dynamic algorithms for data partition
• Noising methods for a clique partitioning problem
• Two local dissimilarity measures for weighted graphs with application to protein interaction networks
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices

Describes a project that uses

Uses Software

• MCODE

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

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