Graph layouts via layered separators
From MaRDI portal
Publication:473100
DOI10.1016/j.jctb.2014.07.005zbMath1303.05036arXiv1302.0304OpenAlexW2963977128WikidataQ61067899 ScholiaQ61067899MaRDI QIDQ473100
Publication date: 21 November 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.0304
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (17)
Parameterized Algorithms for Queue Layouts ⋮ Layered separators in minor-closed graph classes with applications ⋮ The Rique-number of graphs ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Stack and Queue Layouts via Layered Separators ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Lazy queue layouts of posets ⋮ Mixed Linear Layouts of Planar Graphs ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ On the queue-number of graphs with bounded tree-width ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ On mixed linear layouts of series-parallel graphs ⋮ Parameterized Algorithms for Queue Layouts ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding planar graphs in four pages
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
- Layered separators in minor-closed graph classes with applications
- A Separator Theorem for Planar Graphs
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Genus g Graphs Have Pagenumber O(√g)
- Stack and Queue Layouts of Posets
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- On Crossing Sets, Disjoint Sets, and Pagenumber
- Graph Drawing
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- Sorting Using Networks of Queues and Stacks
This page was built for publication: Graph layouts via layered separators