A linear time algorithm for graph partition problems

https://doi.org/10.1016/0020-0190(92)90126-GGet rights and content

First page preview

First page preview
Click to open first page preview

References (16)

  • M.R. Garey et al.

    Some simplified NP-complete graph problems

    Theoret. Comput. Sci.

    (1976)
  • D.W. Matula et al.

    Sparsest cuts and bottlenecks in graphs

    Discrete Appl. Math.

    (1990)
  • B. Bollobás

    Random Graphs

    (1985)
  • G. Chartrand et al.

    Graphs and Diagraphs

  • R.C. Entringer, Personal...
  • P. Erdös, Personal...
  • M.R. Garey et al.

    Computers and Intractability, A Guide to the Theory of NP-Completeness

    (1978)
  • M.K. Goldberg et al.

    On the minimal cut problem

There are more references available in the full text version of this article.

Cited by (6)

  • An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space

    2015, IEEE Transactions on Evolutionary Computation
  • A 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 Algorithms
  • Approximation algorithm on multi-way maxcut partitioning

    1994, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View full text