Angle Covers: Algorithms and Complexity
From MaRDI portal
Publication:5084700
DOI10.7155/jgaa.00576zbMath1489.05144OpenAlexW3211907390MaRDI QIDQ5084700
No author found.
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00576
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- On the hardness of approximating minimum vertex cover
- Some APX-completeness results for cubic graphs
- Planar minimally rigid graphs and pseudo-triangulations
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Thickness and coarseness of graphs
- On a Modified Concept of Thickness of a Graph
- Determining the thickness of graphs is NP-hard
- On the Complexity of Timetable and Multicommodity Flow Problems
- Augmenting Outerplanar Graphs
- Reducibility among Combinatorial Problems
- k-Degenerate Graphs
This page was built for publication: Angle Covers: Algorithms and Complexity