Finding minimum-quotient cuts in planar graphs

DOI10.1145/167088.167284MaRDI QIDQ5248548zbMATH OpenOpenAlexFDO

Authors James K. Park, Cynthia Phillips

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167284

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Cited in

(7)

• Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
• An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs
• Balanced partitions of trees and applications
• Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
• Fast balanced partitioning is hard even on grids and trees
• A polynomial-time approximation scheme for planar multiway cut

This page was built for publication: Finding minimum-quotient cuts in planar graphs

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