Solving NP-hard problems in 'almost trees': vertex cover
From MaRDI portal
Publication:1062757
DOI10.1016/0166-218X(85)90057-5zbMath0573.68017WikidataQ56505202 ScholiaQ56505202MaRDI QIDQ1062757
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Maximum weight independent set in trees ⋮ Heuristics for automated knowledge source integration and service composition ⋮ On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT ⋮ On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT ⋮ Approximability issues of guarding a set of segments
Cites Work
- Unnamed Item
- An Efficient Parallel Biconnectivity Algorithm
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Finding a Maximum Independent Set
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Solving NP-hard problems in 'almost trees': vertex cover
