Mixed Linear Layouts of Planar Graphs
From MaRDI portal
Publication:4625112
DOI10.1007/978-3-319-73915-1_17zbMath1504.05198arXiv1709.00285OpenAlexW2963634989MaRDI QIDQ4625112
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.00285
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Parameterized Algorithms for Queue Layouts ⋮ Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number ⋮ The mixed page number of graphs ⋮ Linear layouts of bipartite planar graphs ⋮ Mixed linear layouts: complexity, heuristics, and experiments ⋮ Lazy queue layouts of posets ⋮ 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
- Graph layouts via layered separators
- On the queue-number of graphs with bounded tree-width
- Embedding planar graphs in four pages
- The book thickness of a graph
- The Book Embedding Problem from a SAT-Solving Perspective
- Radial Level Planarity Testing and Embedding in Linear Time
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- On the Queue Number of Planar Graphs
- Stack and queue number of 2-trees
This page was built for publication: Mixed Linear Layouts of Planar Graphs