Crossing minimization in extended level drawings of graphs
DOI10.1016/J.DAM.2009.09.002zbMATH Open1226.05182OpenAlexW2039722519MaRDI QIDQ968125FDOQ968125
Authors: Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong 
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
Recommendations
- Crossing minimization in perturbed drawings
- Crossing minimization in perturbed drawings
- Improved approximations of crossings in graph drawings
- An alternative method to crossing minimization on hierarchical graphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing minimization in linear embeddings of graphs
- Crossing Layout in Non-planar Graph Drawings
- scientific article; zbMATH DE number 1796980
- A heuristic approach towards drawings of graphs with high crossing resolution
hierarchygraph algorithmcrossing minimization(radial) level graphintra-level edgeslevel/layered drawingvisualization of social networks
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Internet topics (68M11)
Cites Work
- Network analysis. Methodological foundations.
- Drawing graphs. Methods and models
- Graph-Theoretic Concepts in Computer Science
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Radial Level Planarity Testing and Embedding in Linear Time
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- Edge crossings in drawings of bipartite graphs
- Title not available (Why is that?)
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- Multi-circular Layout of Micro/Macro Graphs
- Approximating Crossing Minimization in Radial Layouts
Cited In (12)
- New Approximation to the One-sided Radial Crossing Minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for minimizing edge crossings in radial drawings
- Grid sifting, leveling and crossing reduction
- A global \(k\)-level crossing reduction algorithm
- Crossing Minimization in Storyline Visualization
- Data Structures and their Planar Graph Layouts
- An alternative method to crossing minimization on hierarchical graphs
- Global \(k\)-level crossing reduction
- Multi-level verticality optimization: concept, strategies, and drawing scheme
- Crossing-constrained hierarchical drawings
This page was built for publication: Crossing minimization in extended level drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968125)
