An Alternative Method to Crossing Minimization on Hierarchical Graphs
From MaRDI portal
Publication:2719241
DOI10.1137/S1052623498334013zbMath1010.90098WikidataQ56977375 ScholiaQ56977375MaRDI QIDQ2719241
Publication date: 21 June 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
integer linear programminggraph drawingbranch-and-cutpolyhedral combinatorics2-level graphs2-level planarization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Two-layer planarization parameterized by feedback edge set ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 2-layer right angle crossing drawings ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Crossing numbers of beyond-planar graphs ⋮ Crossing numbers of beyond-planar graphs
Uses Software
This page was built for publication: An Alternative Method to Crossing Minimization on Hierarchical Graphs
