Testing Simultaneous Planarity When the Common Graph Is 2-Connected
From MaRDI portal
Publication:3060792
DOI10.1007/978-3-642-17514-5_35zbMath1310.68163arXiv1009.4517MaRDI QIDQ3060792
Bernhard Haeupler, K. R. Jampani, Anna Lubiw
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.4517
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph, Disconnectivity and relative positions in simultaneous embeddings, Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid