Abstract
We show that planarity testing can be interpreted as a train switching problem. Train switching problems have been studied in the context of permutation networks, i. e., permuting the cars of a train on a given railroad network [5]. The cars enter the network one at a time, some are stored temporarily in the network and the cars leave the network in the prescribed permutation. For the planarity test we use the metaphor of train switching in the context of graph layouts. In a graph layout the vertices are processed according to a total order, i. e., an ordering of the vertices, which is called linear layout. The edges are data items that are inserted to and removed from a given data structure. The vertices are processed in the order of the linear layout. At each vertex, at first all edges incident to preceding vertices are removed from the data structure and then all edges incident to succeeding vertices are inserted into the data structure. These operations must obey the principles of the underlying data structure, such as “LIFO” for a stack or “FIFO” for a queue. A graph G is a stack graph, i. e., has a stack layout, if and only if it is outerplanar, and it is a 2-stack graph if and only if it is a subgraph of a planar graph with a Hamiltonian cycle [3].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Auer, C., Bachmaier, C., Brandenburg, F.J., Brunner, W., Gleißner, A.: Plane Drawings of Queue and Deque Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 68–79. Springer, Heidelberg (2011)
Auer, C., Gleißner, A.: Characterizations of Deque and Queue Graphs. In: Kolman, P., Kratochvíl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 35–46. Springer, Heidelberg (2011)
Bernhart, F., Kainen, P.: The book thickness of a graph. J. Combin. Theory, Ser. B 27(3), 320–331 (1979)
de Fraysseix, H., Rosenstiehl, P.: A depth-first-search characterization of planarity. In: Graph theory (Cambridge, 1981). Ann. Discrete Math., vol. 13, pp. 75–80. North-Holland, Amsterdam (1982)
Tarjan, R.: Sorting using networks of queues and stacks. J. ACM 19(2), 341–346 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auer, C., Gleißner, A., Hanauer, K., Vetter, S. (2013). Testing Planarity by Switching Trains. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)