Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
- 1 January 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 26 (1) , 166-187
- https://doi.org/10.1006/jagm.1997.0894
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- A separator theorem for graphs with an excluded minor and its applicationsPublished by Association for Computing Machinery (ACM) ,1990
- Dynamic programming on graphs with bounded treewidthPublished by Springer Nature ,1988
- Improved algorithms for graph four-connectivityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- An approach to the subgraph homeomorphism problemTheoretical Computer Science, 1985
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsSIAM Journal on Computing, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- A note on primitive skew curvesBulletin of the American Mathematical Society, 1943