A global k-level crossing reduction algorithm

DOI10.1007/978-3-642-11440-3_7MaRDI QIDQ3404430zbMATH OpenOpenAlexFDO

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

Publication date 9 February 2010

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11440-3_7

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Global k-level crossing reduction
• Grid sifting, leveling and crossing reduction
• Crossing minimization in extended level drawings of graphs
• Graph Drawing
• An alternative method to crossing minimization on hierarchical graphs

Cited in

(6)

• A variable depth neighborhood search algorithm for the min-max arc crossing problem
• Global k-level crossing reduction
• scientific article; zbMATH DE number 2080104 (Why is no real title available?)
• Grid sifting, leveling and crossing reduction
• Computing hive plots: a combinatorial framework
• An efficient hybridization of graph representation learning and metaheuristics for the constrained incremental graph drawing problem

This page was built for publication: A global \(k\)-level crossing reduction algorithm

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