A linear time algorithm for graph partition problems
References (16)
- et al.
Some simplified NP-complete graph problems
Theoret. Comput. Sci.
(1976) - et al.
Sparsest cuts and bottlenecks in graphs
Discrete Appl. Math.
(1990) Random Graphs
(1985)- et al.
Graphs and Diagraphs
- R.C. Entringer, Personal...
- P. Erdös, Personal...
- et al.
Computers and Intractability, A Guide to the Theory of NP-Completeness
(1978) - et al.
On the minimal cut problem
There are more references available in the full text version of this article.
Cited by (6)
Tree partitioning under constraints - Clustering for vehicle routing problems
2000, Discrete Applied MathematicsMaximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdos inequality
1999, Discrete MathematicsAn Edge-Set Representation Based on a Spanning Tree for Searching Cut Space
2015, IEEE Transactions on Evolutionary ComputationA spanning tree-based encoding of the MAX CUT problem for evolutionary search
2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure
2011, Journal of Mathematical Modelling and AlgorithmsApproximation algorithm on multi-way maxcut partitioning
1994, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1992 Published by Elsevier B.V.