Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
From MaRDI portal
Publication:2867684
DOI10.1007/978-3-319-03841-4_40zbMath1406.68065arXiv1308.6778OpenAlexW2112136399MaRDI QIDQ2867684
Ignaz Rutter, Thomas Bläsius, Roman Prutkin, Benjamin Niedermann, Martin Nöllenburg, Therese C. Biedl
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6778
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Art gallery problem with rook and queen vision ⋮ Linear ordering based MIP formulations for the vertex separation or pathwidth problem ⋮ Finding small-width connected path decompositions in polynomial time ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
This page was built for publication: Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
