Maximizing the Total Resolution of Graphs
From MaRDI portal
Publication:3073659
DOI10.1007/978-3-642-18469-7_6zbMath1314.68214arXiv1009.2109OpenAlexW2129038900MaRDI QIDQ3073659
Evmorfia N. Argyriou, Antonios Symvonis, Michael A. Bekos
Publication date: 11 February 2011
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.2109
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (12)
On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ A greedy heuristic for crossing-angle maximization ⋮ Drawing graphs with right angle crossings ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Unnamed Item ⋮ Graphs with large total angular resolution ⋮ Angular Resolutions: Around Vertices and Crossings
This page was built for publication: Maximizing the Total Resolution of Graphs
