Optimal k-level planarization and crossing minimization

DOI10.1007/978-3-642-18469-7_22MaRDI QIDQ3073676zbMATH OpenOpenAlexFDO

Authors Graeme Gange, Peter J. Stuckey, Kim Marriott

Publication date 11 February 2011

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18469-7_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• An alternative method to crossing minimization on hierarchical graphs
• An exact approach to upward crossing minimization
• scientific article; zbMATH DE number 2196291
• A New Approach to Exact Crossing Minimization
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

Cited in

(4)

• An SDP approach to multi-level crossing minimization
• Hierarchies and planarity theory
• Bijective comparison of optimal planarity algorithms
• An alternative method to crossing minimization on hierarchical graphs

This page was built for publication: Optimal \(k\)-level planarization and crossing minimization

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