Global k-Level Crossing Reduction

DOI10.7155/jgaa.00242zbMath1276.05051OpenAlexW2121249618MaRDI QIDQ2865048

Wolfgang Brunner, Christian Bachmaier, Ferdinand Hübner, Franz-Josef 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

zbMATH Keywords

number of crossingsdirected graphsedge routingcrossing minimization problemsglobal crossing reductionsifting technique

Mathematics Subject Classification ID

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

Related Items (1)

The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph

Uses Software

• Gravisto
• PESPLib

This page was built for publication: Global k-Level Crossing Reduction