Solving NP-hard problems in ‘almost trees’: Vertex cover
- 31 January 1985
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 10 (1), 27-45
- https://doi.org/10.1016/0166-218x(85)90057-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsJournal of the ACM, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972