Inserting an edge into a planar graph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 246-255

  Gutwenger, Carsten ^a   Mutzel, Petra ^b   Weiskircher, René ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Algorithms; Experimentation; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 64049096958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. AGD User Manual (Version 1.1), 1999. Universitat Wien, Max-Planck-Institut Saarbrficken, Universitat Trier, Universitat zu KSln. See also http://www.mpi-sb.mpg.de/AGD/.
2. Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu, An experimental comparison of four graph drawing algorithms, Computational Geometry: Theory and Applications, v.7 n.5-6, p.303-325, April 1997 [doi〉10.1016/S0925-7721(96)00005-3]
3. Giuseppe Di Battista , Roberto Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, v.25 n.5, p.956-997, Oct. 1996 [doi〉10.1137/ S0097539794280736]
4. Norishige Chiba , Takao Nishizeki , Shigenobu Abe , Takao Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, Journal of Computer and System Sciences, v.30 n.1, p.54-76, Feb. 1985 [doi〉10.1016/0022-0000(85) 90004-2]
5. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal Alg. Disc. Methods, 4:312-316, 1983.
6. Ashim Garg , Roberto Tamassia, On the Compuational Complexity of Upward and Rectilinear Planarity Testing, Proceedings of the DIMACS International Workshop on Graph Drawing, p.286-297, October 10-12, 1994
7. C. Gutwenger and P. Mutzel. A linear-time implementation of SPQR-trees. Technical report, Technische Universitat Wien, to appear.
8. David Harel , Meir Sardas, Randomized graph drawing with heavy-duty preprocessing, Proceedings of the workshop on Advanced visual interfaces, p.19-33, June 01-04, 1994, Bari, Italy [doi〉10.1145/192309.192319]
9. M. Jfinger, S. Leipert, and P. Mutzel. A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided Design, 17(7):609-612, 1998.
10. K. Mehlhorn and P. Mutzel. On the embedding phase of the Hopcroft and Taxjan planaxity testing algorithm. Algorithmica, 16(2):233-242, 1996.
11. Petra Mutzel , René Weiskircher, Optimizing over All Combinatorial Embeddings of a Planar Graph, Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.361-376, June 09-11, 1999
12. Petra Mutzel , René Weiskircher, Computing Optimal Embeddings for Planar Graphs, Proceedings of the 6th Annual International Conference on Computing and Combinatorics, p.95-104, July 26-28, 2000
13. Farhad Shahrokhi , László A. Székely , Imrich Vrto, Crossing Numbers of Graphs, Lower Bound Techniques, Proceedings of the DIMACS International Workshop on Graph Drawing, p.131-142, October 10-12, 1994
14. Roberto Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM Journal on Computing, v.16 n.3, p.421-444, June 1987 [doi〉10.1137/0216030]