Implementing a Partitioned 2-Page Book Embedding Testing Algorithm

Angelini, Patrizio and Di Bartolomeo, Marco and Di Battista, Giuseppe (2013) Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 79-89(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

In a book embedding the vertices of a graph are placed on the "spine" of a "book" and the edges are assigned to "pages" so that edges on the same page do not cross. In the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets $E_1$ and $E_2$, the pages are two, the edges of $E_1$ are assigned to page 1, and the edges of $E_2$ are assigned to page 2. The problem consists of checking if an ordering of the vertices exists along the spine so that the edges of each page do not cross. Hong and Nagamochi [13] give an interesting and complex linear time algorithm for tackling Partitioned 2-page Book Embedding based on SPQR-trees. We show an efficient implementation of this algorithm and show its effectiveness by performing a number of experimental tests. Because of the relationships [13] between Partitioned 2-page Book Embedding and clustered planarity we yield as a side effect an implementation of a clustered planarity testing where the graph has exactly two clusters.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_8
Classifications: G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.999 Others
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:46
Last Modified: 27 Nov 2013 10:50
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1299

Actions (login required)

View Item View Item