Optimal k-Level Planarization and Crossing Minimization

DOI10.1007/978-3-642-18469-7_22zbMath1314.68231OpenAlexW777473119MaRDI QIDQ3073676

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

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

This page was built for publication: Optimal k-Level Planarization and Crossing Minimization