Global k-level crossing reduction

DOI10.7155/JGAA.00242zbMATH Open1276.05051OpenAlexW2121249618MaRDI QIDQ2865048FDOQ2865048

Authors: Christian Bachmaier, Wolfgang Brunner, Ferdinand Hübner, Franz J. Brandenburg 

Publication date: 28 November 2013

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

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

Recommendations

• A global \(k\)-level crossing reduction algorithm
• Grid sifting, leveling and crossing reduction
• Crossing minimization in extended level drawings of graphs
• An alternative method to crossing minimization on hierarchical graphs
• Cyclic Leveling of Directed Graphs

zbMATH Keywords

directed graphsedge routingnumber of crossingscrossing minimization problemsglobal crossing reductionsifting technique

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (11)

• Column-based graph layouts
• Graph Drawing
• Grid sifting, leveling and crossing reduction
• The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
• A global \(k\)-level crossing reduction algorithm
• Title not available (Why is that?)
• An alternative method to crossing minimization on hierarchical graphs
• Computing hive plots: a combinatorial framework
• Multi-level verticality optimization: concept, strategies, and drawing scheme
• Cyclic Leveling of Directed Graphs
• Title not available (Why is that?)

Uses Software

• Gravisto
• PESPLib

This page was built for publication: Global \(k\)-level crossing reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865048)