Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
暂无分享,去创建一个
Ignaz Rutter | Giuseppe Di Battista | Fabrizio Frati | Maurizio Patrignani | Patrizio Angelini | G. Battista | M. Patrignani | Ignaz Rutter | Fabrizio Frati | Patrizio Angelini
[1] Michael Kaufmann,et al. Two Trees Which Are Self-intersecting When Drawn Simultaneously , 2005, Graph Drawing.
[2] Jan Kratochvíl,et al. Testing planarity of partially embedded graphs , 2010, SODA '10.
[3] Emilio Di Giacomo,et al. Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles , 2007, Int. J. Comput. Geom. Appl..
[4] Michael Jünger,et al. Intersection Graphs in Simultaneous Embedding with Fixed Edges , 2009, J. Graph Algorithms Appl..
[5] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[6] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[7] Petra Mutzel,et al. A Linear Time Implementation of SPQR-Trees , 2000, GD.
[8] Michael Jünger,et al. An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges , 2009, GD.
[9] Max I. Kanovich,et al. The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map , 2007, Discrete Mathematics.
[10] Michael Jünger,et al. Simultaneous Geometric Graph Embeddings , 2007, GD.
[11] Roberto Tamassia,et al. On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.
[12] Hiroshi Nagamochi,et al. Two-page Book Embedding and Clustered Graph Planarity , 2009 .
[13] Joseph S. B. Mitchell,et al. On Simultaneous Planar Graph Embeddings , 2003, WADS.
[14] Fabrizio Frati. Embedding Graphs Simultaneously with Fixed Edges , 2007 .
[15] Stephen G. Kobourov,et al. Simultaneous Embedding of Planar Graphs with Few Bends , 2004, Graph Drawing.
[16] Roberto Tamassia,et al. On-Line Planarity Testing , 1989, SIAM J. Comput..
[17] Michael Kaufmann,et al. Two trees which are self-intersecting when drawn simultaneously , 2005, Discret. Math..
[18] Bernhard Haeupler,et al. Testing Simultaneous Planarity when the Common Graph is 2-Connected , 2010, J. Graph Algorithms Appl..
[19] TamassiaRoberto,et al. On-Line Planarity Testing , 1996 .
[20] Michael Jünger,et al. Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges , 2011, Comput. Geom..
[21] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[22] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[23] Michael Jünger,et al. Simultaneous Graph Embeddings with Fixed Edges , 2006, WG.