Article

Free access

Finding minimum-quotient cuts in planar graphs

Authors:

James K. Park,

Cynthia A. PhillipsAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 766 - 775

https://doi.org/10.1145/167088.167284

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

B. Baker. Approximation algorithms for NP- complete problems on planar graphs, in Proceedings of the 2#th Annual IEEE Symposzum on Foundations of Computer Science, pages 265-273, 1983.

Digital Library

Google Scholar

[2]

S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems, journal of Computer and System Sczences, 28(2):300-343, 1984.

Google Scholar

[3]

T. N. But and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. information Processing Letters, 42(3):153-159, 1992.

Digital Library

Google Scholar

[4]

T. N. But and A. Peck. Partitioning planar graphs. SIAM Journal on Computing, 21(2):203-215, 1992.

Digital Library

Google Scholar

[5]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. W. H. Freeman and Company, San Francisco, CA, 1979.

Digital Library

Google Scholar

[6]

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.

Google Scholar

[7]

R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexzty of Computer Computations, pages 85-103. Plenum Press, New York, NY, 1972.

Crossref

Google Scholar

[8]

F. T. Leighton and S. B. Rao. An approximate max-flow rain-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedzngs of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 422-431, 1988.

Digital Library

Google Scholar

[9]

R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177-189, 1979.

Digital Library

Google Scholar

[10]

R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615-627, 1980.

Digital Library

Google Scholar

[11]

N. Megiddo. Combinatorial optimization with rational objective functions. Mathematic8 of Operatzons Research, 4(4):414-424, 1979.

Google Scholar

[12]

N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the A CM, 30(4):852-865, 1983.

Digital Library

Google Scholar

[13]

B. Mohar. Isoperimetric numbers of graphs. Journal of Combinatorial Theory, Seines B, 47:274-291, 1989.

Digital Library

Google Scholar

[14]

S. B. Rao. Finding near optimal separators in planar graphs. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 225-237, 1987.

Digital Library

Google Scholar

[15]

S. B. Rao. Faster algorithms for finding small edge cuts in planar graphs. In Proceedings of the 24th Annual A CM Symposzum on Theory of Computzng, pages 229-240, 1992.

Digital Library

Google Scholar

Cited By

View all

Cohen-Addad VGupta AKlein PLi JKhuller SVassilevska Williams V(2021)A quasipolynomial (2 + ε)-approximation for planar sparsest cutProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451103(1056-1069)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451103
Baïou MBarahona F(2018)Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problemMathematical Programming: Series A and B10.5555/3288898.3288957172:1-2(59-75)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288898.3288957
Cabello S(2018)Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar GraphsACM Transactions on Algorithms10.1145/321882115:2(1-38)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3218821
Show More Cited By

Index Terms

Finding minimum-quotient cuts in planar graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Randomness, geometry and discrete structures

Recommendations

On finding convex cuts in general, bipartite and plane graphs

The general notion of convexity also applies to a graph G=(V,E). A subset Vc of V is called a convex set if all shortest paths with end vertices in Vc remain within Vc. A convex cut of G is a partition (V1,V2) of V such that V1 and V2 are convex sets (...
Cuts leaving components of given minimum order

For a connected graph G, the restricted edge-connectivity @l"p(G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that each component of G-S contains at least p vertices. In the present paper we introduce the more general ...
Minimal disconnected cuts in planar graphs

The problem of finding a disconnected cut in a graph is NP-hard in general but polynomial-time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP-hard but its computational complexity was not known for planar graphs. ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
903
Total Downloads

Downloads (Last 12 months)76
Downloads (Last 6 weeks)7

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cohen-Addad VGupta AKlein PLi JKhuller SVassilevska Williams V(2021)A quasipolynomial (2 + ε)-approximation for planar sparsest cutProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451103(1056-1069)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451103
Baïou MBarahona F(2018)Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problemMathematical Programming: Series A and B10.5555/3288898.3288957172:1-2(59-75)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288898.3288957
Cabello S(2018)Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar GraphsACM Transactions on Algorithms10.1145/321882115:2(1-38)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3218821
Erickson JFox KLkhamsuren LDiakonikolas IKempe DHenzinger M(2018)Holiest minimum-cost paths and flows in surface graphsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188904(1319-1332)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188904
Baïou MBarahona F(2018)Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problemMathematical Programming10.1007/s10107-017-1227-3172:1-2(59-75)Online publication date: 27-Jan-2018
https://doi.org/10.1007/s10107-017-1227-3
Cabello SKlein P(2017)Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039825(2143-2152)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039825
Baïou MBarahona F(2016)Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections withźthe Max-Cut ProblemProceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization - Volume 968210.1007/978-3-319-33461-5_6(63-76)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-33461-5_6
Fox KKlein PMozes SServedio RRubinfeld R(2015)A Polynomial-time Bicriteria Approximation Scheme for Planar BisectionProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746564(841-850)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746564
Feldmann AWidmayer P(2015)An $$O(n^4)$$O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid GraphsAlgorithmica10.1007/s00453-014-9928-y71:1(181-200)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s00453-014-9928-y
Feldmann AFoschini L(2015)Balanced Partitions of Trees and ApplicationsAlgorithmica10.1007/s00453-013-9802-371:2(354-376)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s00453-013-9802-3
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On finding convex cuts in general, bipartite and plane graphs

Cuts leaving components of given minimum order

Minimal disconnected cuts in planar graphs