Embedding planar graphs at fixed vertex locations

Graphs and Combinatorics

Volumn 17, Issue 4, 2001, Pages 717-728

  Pach, János ^a,b,d   Wenger, Rephael ^c  

^a CITY COLLEGE OF NEW YORK   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c OHIO STATE UNIVERSITY   (United States)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544387437     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007258     Document Type: Article

References (11)

1. Bastert, O., Fekete, S.: Geometrische verdrahtungsprobleme. Technical Report 96.247, Angew. Math. Inf. Universität zu Köln, Köln, Germany 1996
2. Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Am. Math. Month. 98, 165-166 (1991) (Solution to problem E3341)
3. Lawrencenko, S., Liu, X., Liu, Y.: An algorithm for constructing a rectilinear embedding of a given graph in the plane. In: Combinatorics and Graph Theory '95 (River Edge, NJ, 1995), vol. 1, pp. 205-217 World Sci. Publishing
4. Leighton, F.: Complexity Issues in VLSI. Cambridge: MIT Press 1983
5. Liu, Y.: Embeddability in Graphs. Amsterdam: Kluwer 1995
6. Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Appl. Math. 81, 69-91 (1998)
7. Pach, J., Agarwal, P.: Combinatorial Geometry. New York: John Wiley and Sons 1995
8. Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16, 111-117 (1996) (Special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia)
9. Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16, 111-117 (1996) (Special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia)
10. Souvaine, D., Wenger, R.: Constructing piecewise linear homeomorphisms. Technical Report 94-52, DIMACS, New Jersey: New Brunswick 1994
11. Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16 (3), 421-444 (1987)