Embedding vertices at points: Few bends suffice for planar graphs

Journal of Graph Algorithms and Applications

Volumn 6, Issue 1, 2002, Pages 115-129

  Kaufmann, Michael ^a   Wiese, Roland ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

A-PLANE; EMBEDDINGS; FEWER BENDS; NP COMPLETE; OUTERPLANAR GRAPH; PLANAR GRAPH; PLANE GRAPHS; POINT SET;

MAPPING;

EID: 4043064916     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00046     Document Type: Conference Paper

References (17)

1. Bose, P., On Embedding an Outer-Planar Graph in a Point Set, in: G. DiBattista (ed.), Proc. 5th Intern. Symposium on Graph Drawing (GD'97), LNCS 1353, Springer 1998, pp. 25-36.
2. Bose, P., M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications 1998.
3. Castaneda, N. and J. Urrutia., Straight line embeddings of planar graphs on point sets. Proc. 8th Canadian conf. on Comp. Geom., pp. 312-318, 1996.
4. Chiba, N., and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985), pp. 210-223.
5. Chiba, N., and T. Nishizeki, The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs, J. Algorithms 10 (1989), pp. 189-211.
6. Chvatal, V., The traveling salesman problem, J. Wiley and Sons, 1985, pp. 426.
7. Di Battista, G., Eades, P., Tamassia R. and I.G. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Brown Univ., Tech. Rep., 1993.
8. Feige, U., Approximation the bandwidth via volume respecting embeddings. Proc. 30th Annual ACM Symp. on Theory of Computing, 1998, pp. 90-99.
9. Garey, M.R., D.S. Johnson, The Rectilinear Steiner Tree Problem is NP-complete, SIAM J. Appl. Math. 32 (1977), pp. 826-834.
10. Garey, M.R., D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comp. Science 1 (1976), pp. 237-267.
11. Gritzmann, P., Mohar, B., Pach, J. and Pollack, R. Embedding a planar triangulation with vertices at specified points. in: American Mathematical Monthly 98 (1991), pp. 165-166. (Solution to problem E3341).
12. Ikebe Y., M. Perles, A. Tamura and S. Tokunaga, The rooted tree embedding problem into points in the plane, Discr. and Comp. Geometry 11 (1994), pp. 51-63.
13. Lengauer, Th., Combinatorial Algorithms for Integrated Circuit Layout, Wiley, 1990.
14. Leighton, F.T., Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, Morgan Kaufmann, 1992.
15. Pach J. and R. Wenger, Embedding Planar Graphs at Fixed Vertex Locations, in: Sue Whitesides (ed.), Proc. 6th Intern. Symposium on Graph Drawing (GD'98), LNCS 1547, Springer 1999, pp. 263-274.
16. Pach J. and J. Töröcsik, Layout of rooted trees, in: W.T. Trotter (ed.), Planar Graphs, vol. 9 of DIMACS Series, pages 131-137, 1993.
17. Papadimitriou, Ch., The NP-completeness of the bandwidth minimization problem, Computing, 16(3), 1976, pp. 263-270.