2-Layer Graph Drawings with Bounded Pathwidth
From MaRDI portal
Publication:6181954
DOI10.7155/jgaa.00647zbMath1529.05119arXiv2207.06656MaRDI QIDQ6181954
Publication date: 20 December 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.06656
Cites Work
- Unnamed Item
- Unnamed Item
- 2-layer right angle crossing drawings
- On the parameterized complexity of layered graph drawing
- Graph minors. I. Excluding a forest
- Quickly excluding a forest
- A partial k-arboretum of graphs with bounded treewidth
- Edge crossings in drawings of bipartite graphs
- Drawing graphs in two layers
- Crossing-number critical graphs have bounded path-width
- Track layouts, layered path decompositions, and leveled planarity
- On the one-sided crossing minimization in a bipartite graph with large degrees
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- Crossing number for graphs with bounded pathwidth
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- A fixed-parameter approach to 2-layer planarization
- A decomposition theorem for partially ordered sets
- Drawing Graphs on Two and Three Lines
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Graph Minors I: A Short Proof of the Path-width Theorem
- 2-Layer k-Planar Graphs
- Two Results on Layered Pathwidth and Linear Layouts
- Layout of Graphs with Bounded Tree-Width
