Angle covers: algorithms and complexity
From MaRDI portal
Publication:5084700
Recommendations
Cites work
- k-Degenerate Graphs
- Augmenting Outerplanar Graphs
- Determining the thickness of graphs is NP-hard
- On a Modified Concept of Thickness of a Graph
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the hardness of approximating minimum vertex cover
- Planar minimally rigid graphs and pseudo-triangulations
- Reducibility among combinatorial problems
- Some APX-completeness results for cubic graphs
- Thickness and coarseness of graphs
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(2)
This page was built for publication: Angle covers: algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084700)