Triangulating Planar Graphs while Minimizing the Maximum Degree

Information and Computation

Volumn 135, Issue 1, 1997, Pages 1-14

  Kant, Goos ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343141099     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2635     Document Type: Article

References (30)

1. Biedl, T., Kant, G., and Kaufmann, M. (1994), On triangulating planar graphs under the four-connectivity constraint, in "Proc. 4nd Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 824, pp. 83-94, Springer-Verlag, Berlin/New York.
2. Chrobak, M., and Payne, T. H. (1990), "A Linear Time Algorithm for Drawing Planar Graphs on the Grid," Tech. Rep. UCR-CS-90-2, Dept. of Mathematics and Computer Science, University of California at Riverside.
3. Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. G. (1994), Algorithms for automatic graph drawing: An annotated bibliography, Comput. Geom. Theory Appl. 4, 235-282.
4. Di Battista, G., and Vismara, L. (1993), Angles of planar triangular graphs, in "Proc. 25th Annual ACM Symp. Theory of Computing," pp. 431-437. [Extended abstract]
5. Edelsbrunner, H. (1991), "Triangulations," Tech. Report CS 497, Dept. of Computer Science, University of Illinois at Urbana-Champaign.
6. Eswaran, K. P., and Tarjan, R. E. (1976), Augmentation problems, SIAM J. Comput. 5, 653-665.
7. Frank, A. (1990), Augmenting graphs to meet edge-connectivity requirements, in "Proc. 31th Annual IEEE Symposium on Foundations on Computer Science," pp. 708-718,.
8. de Fraysseix, H., and Ossona de Mendez, P. (1995), Regular orientations, arboricity and augmentation, in "Proc. Graph Drawing '94," Lecture Notes in Computer Science, Vol. 894, pp. 111-118, Springer-Verlag, Berlin/New York.
9. de Fraysseix, H., Pach, J., and Pollack, R. (1990), How to draw a planar graph on a grid, Combinatorial 10, 41-51.
10. Gabow, H. N. (1991), Applications of a poset representation to edge connectivity and graph rigidity, in "Proc. 32th Annual IEEE Symposium on Foundations of Computer Science," pp. 812-821,.
11. Garey, M. R., Johnson, D. S., and Stockmeyer, L. (1976), Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1, 237-267.
12. Garg, A., and Tamassia, R. (1994), Planar drawings and angular resolution: Algorithms and bounds, in "Proc. 2nd European Symposium on Algorithms (ESA'94)," pp. 12-23,.
13. Hagerup, T., and Uhrig, C. (1991), Triangulating a planar graph, in "Library of Efficient Datatypes and Algorithms (LEDA)," Max-Plank Institut für Informatik, Saarbrücken. [Software package]
14. Hsu, T.-S. (1992), On four-connecting a unconnected graph, in "Proc. 33st Annual IEEE Symposium on Foundations of Computer Science," pp. 70-79.
15. Hsu, T.-S., and Ramachandran, V. (1991), A linear time algorithm for triconnectivity augmentation, in "Proc. 32th Annual IEEE Symposium on Foundations of Computer Science," pp. 548-559,.
16. Hsu, T.-S., and Ramachandran, V. (1992), On finding a smallest augmentation to biconnect a graph, in "Proc. 2nd Annual International Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 557, pp. 326-335, Springer-Verlag, Berlin/ New York.
17. Jansen, K. (1993), One strike against the min-max degree triangulation problem, Comput. Geom. 3, 107-120.
18. Kant, G. (1996), Drawing planar graphs using the canonical ordering, Algorithmica 16, 4-32.
19. Kant, G. (1993), "Algorithms for Drawing Planar Graphs," Ph.D. thesis, Department of Computer Science, Utrecht University.
20. Kant, G. (1996), Augmenting outerplanar graphs, J. Algorithms 21, 1-25.
21. Malitz, S., and Papakostas, A. (1994), On the angular resolution of planar graphs, SIAM J. Discrete Math. 7, 177-183.
22. Mohar, B. (1993), Circle packings of maps in polynomial time, submitted for publication.
23. Naor, D., Gusfield, D., and Martel, C. (1990), A fast algorithm for optimally increasing the edge-connectivity, in "Proc. 31st Annual IEEE Symposium on Foundations of Computer Science," pp. 698-707.
24. Read, R. C. (1987), A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56, 31-44.
25. Rosenthal, A., and Goldner, A. (1977), Smallest augmentations to biconnected a graph, SIAM J. Comput. 6, 55-66.
26. Schnyder, W. (1990), Embedding planar graphs on the grid, in "Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 138-147.
27. Watanabe, T., Higashi, Y., and Nakamura, A. (1990), Graph augmentation problems for a specified set of vertices, in "Proc. 1st Annual International Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 450, pp. 378-387, Springer-Verlag, Berlin/New York.
28. Watanabe, T., and Nakamura, A. (1987), Edge-connectivity augmentation problems, J. Comput. System Sci. 35, 96-144.
29. Watanabe, T., and Nakamura, A. J. (1993), A minimum 3-connectivity augmentation of a graph, J. Comput. System Sci. 46, 91-128.
30. Watanabe, T., Yamakado, M., and Onaga, K. (1991), A linear time augmenting algorithm for 3-edge-connectivity augmentation problems, in "Proc. 1991 IEEE International Symposium on Circuits and Systems," pp. 1168-1171.