Mixed linear layouts: complexity, heuristics, and experiments

DOI10.1007/978-3-030-35802-0_35OpenAlexW2989563254MaRDI QIDQ2206878

Philipp de Col, Martin Nöllenburg, Fabian Klute

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ On mixed linear layouts of series-parallel graphs ⋮ Parameterized Algorithms for Queue Layouts ⋮ On Mixed Linear Layouts of Series-Parallel Graphs

Cites Work

• Embedding planar graphs in four pages
• The book thickness of a graph
• Algorithms for the fixed linear crossing number problem
• A left-first search algorithm for planar graphs
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Mixed Linear Layouts of Planar Graphs
• Experimental Evaluation of Book Drawing Algorithms
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Unnamed Item
• Unnamed Item

This page was built for publication: Mixed linear layouts: complexity, heuristics, and experiments