On Mixed Linear Layouts of Series-Parallel Graphs

  title={On Mixed Linear Layouts of Series-Parallel Graphs},
  author={Patrizio Angelini and Michael A. Bekos and Philipp Kindermann and Tamara Mchedlidze},
  booktitle={International Symposium Graph Drawing and Network Visualization},
A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same stack cross and no two edges in the same queue nest. In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1-stack 1-queue layout. Recently, Pupyrev disproved this conjectured by demonstrating a planar partial 3-tree that does not admit a 1-stack 1-queue layout. In this note, we strengthen… 

The Mixed Page Number of Graphs

Directed Acyclic Outerplanar Graphs Have Constant Stack Number

The stack number of a directed acyclic graph G is the minimum k for which there is a topological ordering of G and a k -coloring of the edges such that no two edges of the same color cross, i.e.,

Parameterized Algorithms for Queue Layouts

This paper presents two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts and uses a more restrictive parameter, the vertex cover number, to solve the problem for arbitrary graphs.



Mixed Linear Layouts of Planar Graphs

This work disproves the conjecture that every planar graph admits a mixed mixed layout in which every edge is assigned to a stack or to a queue that use a common vertex ordering, and provides a planargraph that does not have such a mixed layout.

Queue Layouts of Planar 3-Trees

This work improves the upper bound to five and shows that there exist planar 3-trees, whose queue number is at least four; this is the first example of a planar graph with queue number greater than three.

Graph layouts via layered separators

  • V. Dujmovic
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. B
  • 2015

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

This work shows NP-completeness results on the recognition problem of certain mixed linear layouts and presents a new heuristic for minimizing conflicts that is an improvement over previous heuristics for linear layouts.

Laying out Graphs Using Queues

It is proved that the problem of recognizing 1-queue graphs is NP-complete and relationships between the queuenumber of a graph and its bandwidth and separator size are presented.

On Linear Layouts of Graphs

This is the first paper to investigate arch layouts, and characterisation of k-arch graphs as the \emphalmost (k+1)-colourable graphs; that is, the graphs G with a set S of at most k vertices, such that G S is (k-1-colourable.

Two-Page Book Embeddings of 4-Planar Graphs

This paper affirmatively answers the question whether this result can be extended to a class of graphs of degree greater than three and proposes a quadratic-time algorithm based on the book embedding viewpoint of the problem.

On the Queue-Number of Graphs with Bounded Tree-Width

It is shown that for each $k\geq1$ graphs with tree-width at most $k$ have queue-number at most £2^k-1, which improves upon double exponential upper bounds due to Dujmovic et al. and Giacomo et al and solves a problem of Rengarajan and Veni Madhavan.

Stack and Queue Number of 2-Trees

It is shown that the class of 2-trees requires 2-pages for a book embedding and 3-queues for a queue layout, and the first result is new and the latter result extends known results on subclasses of planar graphs.

A left-first search algorithm for planar graphs

We give anO(|V(G)|)-time algorithm to assign vertical and horizontal segments to the vertices of any bipartite plane graphG so that (i) no two segments have an interior point in common, and (ii) two