Graph Bipartization and via minimization
- 1 February 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (1) , 38-47
- https://doi.org/10.1137/0402004
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On the contact-minimization-problemPublished by Springer Nature ,2005
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- A graph-theoretic via minimization algorithm for two-layer printed circuit boardsIEEE Transactions on Circuits and Systems, 1983
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Node-Deletion NP-Complete ProblemsSIAM Journal on Computing, 1979
- Node-and edge-deletion NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1978
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”SIAM Journal on Computing, 1977
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975