Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Authors:
- Patrizio AngeliniPAPatrizio Angelini
- Giuseppe Di BattistaGBGiuseppe Di Battista
- Fabrizio FratiFFFabrizio Frati
- Maurizio PatrignaniMPMaurizio Patrignani
- Ignaz RutterIRIgnaz Rutter
- 1 July 2012
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 14, 150-172
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Testing Planarity of Partially Embedded Graphs2010
- Two trees which are self-intersecting when drawn simultaneouslyDiscrete Mathematics, 2009
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLESInternational Journal of Computational Geometry & Applications, 2007
- On simultaneous planar graph embeddingsComputational Geometry, 2007
- Simultaneous Embedding of Planar Graphs with Few BendsJournal of Graph Algorithms and Applications, 2005
- On-Line Planarity TestingSIAM Journal on Computing, 1996
- On-Line Maintenance of Triconnected Components with SPQR-TreesAlgorithmica, 1996
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979