On Mixed Linear Layouts of Series-Parallel Graphs

DOI10.1007/978-3-030-68766-3_12OpenAlexW3133772719MaRDI QIDQ5014112

Philipp Kindermann, Patrizio Angelini, Tamara Mchedlidze, Michael A. Bekos

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.10475

zbMATH Keywords

series-parallel graphsqueue layoutsbook embeddingsmixed linear layouts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Parameterized Algorithms for Queue Layouts ⋮ The mixed page number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Two-page book embeddings of 4-planar graphs
• 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
• 1-page and 2-page drawings with bounded number of crossings per edge
• Track layouts, layered path decompositions, and leveled planarity
• A left-first search algorithm for planar graphs
• Embedding planar 5-graphs in three pages
• Planar graphs that need four pages
• Mixed linear layouts: complexity, heuristics, and experiments
• Hamiltonian circuits in simplicial complexes
• Extension of a theorem of Whitney
• Stack and Queue Layouts via Layered Separators
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Mixed Linear Layouts of Planar Graphs
• Halin graphs and the travelling salesman problem
• Four pages are indeed necessary for planar graphs
• Planar Graphs Have Bounded Queue-Number
• On the Queue Number of Planar Graphs
• On dispersable book embeddings
• Queue layouts of planar 3-trees
• Stack and queue number of 2-trees

This page was built for publication: On Mixed Linear Layouts of Series-Parallel Graphs