Crossing minimization in extended level drawings of graphs

DOI10.1016/j.dam.2009.09.002zbMath1226.05182OpenAlexW2039722519MaRDI QIDQ968125

Hedi Buchner, Seok-Hee Hong, Michael Forster, Christian Bachmaier

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.002

zbMATH Keywords

graph algorithmhierarchycrossing minimization(radial) level graphintra-level edgeslevel/layered drawingvisualization of social networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Internet topics (68M11)

Related Items (1)

Data Structures and their Planar Graph Layouts

Cites Work

• Unnamed Item
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• Edge crossings in drawings of bipartite graphs
• Network analysis. Methodological foundations.
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Radial Level Planarity Testing and Embedding in Linear Time
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Multi-circular Layout of Micro/Macro Graphs
• Approximating Crossing Minimization in Radial Layouts
• Graph-Theoretic Concepts in Computer Science
• Drawing graphs. Methods and models

This page was built for publication: Crossing minimization in extended level drawings of graphs