Testing Simultaneous Planarity when the Common Graph is 2-Connected
Journal of Graph Algorithms and Applications, Tome 17 (2013) no. 3, pp. 147-171.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Two planar graphs G1 and G2 sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the shared graph is 2-connected. Our algorithm extends to the case of k planar graphs where each vertex [edge] is either common to all graphs or belongs to exactly one of them, and the common subgraph is 2-connected.
DOI : 10.7155/jgaa.00289
Keywords: simultaneous embedding, planar graph, PQ tree, graph drawing, planarity test
@article{JGAA_2013_17_3_a0,
     author = {Bernhard Haeupler and Krishnam Raju Jampani and Anna Lubiw},
     title = {Testing {Simultaneous} {Planarity} when the {Common} {Graph} is {2-Connected}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {147--171},
     publisher = {mathdoc},
     volume = {17},
     number = {3},
     year = {2013},
     doi = {10.7155/jgaa.00289},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00289/}
}
TY  - JOUR
AU  - Bernhard Haeupler
AU  - Krishnam Raju Jampani
AU  - Anna Lubiw
TI  - Testing Simultaneous Planarity when the Common Graph is 2-Connected
JO  - Journal of Graph Algorithms and Applications
PY  - 2013
SP  - 147
EP  - 171
VL  - 17
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00289/
DO  - 10.7155/jgaa.00289
LA  - en
ID  - JGAA_2013_17_3_a0
ER  - 
%0 Journal Article
%A Bernhard Haeupler
%A Krishnam Raju Jampani
%A Anna Lubiw
%T Testing Simultaneous Planarity when the Common Graph is 2-Connected
%J Journal of Graph Algorithms and Applications
%D 2013
%P 147-171
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00289/
%R 10.7155/jgaa.00289
%G en
%F JGAA_2013_17_3_a0
Bernhard Haeupler; Krishnam Raju Jampani; Anna Lubiw. Testing Simultaneous Planarity when the Common Graph is 2-Connected. Journal of Graph Algorithms and Applications, Tome 17 (2013) no. 3, pp. 147-171. doi : 10.7155/jgaa.00289. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00289/

Cité par Sources :