Angle covers: algorithms and complexity

DOI10.7155/JGAA.00576MaRDI QIDQ5084700zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00576

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• New results on drawing angle graphs
• Face covers and the genus problem for apex graphs
• Drawing Graphs in the Plane with High Resolution
• scientific article; zbMATH DE number 1236360
• The Complexity of Angular Resolution

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)

• scientific article; zbMATH DE number 7760172 (Why is no real title available?)
• Angle covers: algorithms and complexity

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)