Finding separator cuts in planar graphs within twice the optimal
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A near optimal algorithm for edge separators (preliminary version)Published by Association for Computing Machinery (ACM) ,1994
- Finding minimum-quotient cuts in planar graphsPublished by Association for Computing Machinery (ACM) ,1993
- Finding near optimal separators in planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Area-efficient graph layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Dimer Statistics and Phase TransitionsJournal of Mathematical Physics, 1963