메뉴 건너뛰기




Volumn 894, Issue , 1995, Pages 286-297

On the computational complexity of upward and rectilinear planarity testing

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS);

EID: 84957570634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58950-3_384     Document Type: Conference Paper
Times cited : (65)

References (30)
  • 4
    • 85005976373 scopus 로고
    • A better heuristic for orthogonal graph drawings
    • LNCS Springer-Verlag
    • T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. European Symp. on Algorithms, LNCS vol. 855, pp. 24-35. Springer-Verlag, 1994.
    • (1994) Proc. European Symp. on Algorithms , vol.855 , pp. 24-35
    • Biedl, T.1    Kant, G.2
  • 5
    • 84947951394 scopus 로고    scopus 로고
    • Algorithms for drawing graphs: An annotated bibüography
    • to appear. Preprint
    • G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibüography. Comput. Geom. Theory Appl., to appear. Preprint available by ftp from ftp. es. brown. edu: pub/papers/compgeo/.
    • Comput. Geom. Theory Appl
    • Di Battista, G.1    Eades, P.2    Tamassia, R.3    Tollis, I.G.4
  • 6
    • 85029494901 scopus 로고
    • Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs
    • LNCS Springer-Verlag
    • G. Di Battista, G. Liotta, and F. Vargiu. Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs. In Proc. Workshop Algorithms Data Struct., LNCS vol. 709, pp. 151-162. Springer-Verlag, 1993.
    • (1993) Proc. Workshop Algorithms Data Struct , vol.709 , pp. 151-162
    • Di Battista, G.1    Liotta, G.2    Vargiu, F.3
  • 7
    • 0025625625 scopus 로고
    • Bipartite graphs upward drawings and planarity
    • G. Di Battista, W. P. Liu, and I. Rival. Bipartite graphs upward drawings and planarity. Inform. Process. Lett., 36: 317-322, 1990.
    • (1990) Inform. Process. Lett , vol.36 , pp. 317-322
    • Di Battista, G.1    Liu, W.P.2    Rival, I.3
  • 8
    • 0024108464 scopus 로고
    • Algorithms for plane representations of acyclic digraphs
    • G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61: 175-198, 1988.
    • (1988) Theoret. Comput. Sci , vol.61 , pp. 175-198
    • Di Battista, G.1    Tamassia, R.2
  • 14
    • 38249036919 scopus 로고
    • Fundamentals of planar ordered sets
    • D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63: 197-216, 1987.
    • (1987) Discrete Math , vol.63 , pp. 197-216
    • Kelly, D.1
  • 15
    • 0009046907 scopus 로고
    • Planar lattices
    • D. Kelly and I. Rival. Planar lattices. Canad. J. Math., 27(3): 636-665, 1975.
    • (1975) Canad. J. Math , vol.27 , Issue.3 , pp. 636-665
    • Kelly, D.1    Rival, I.2
  • 18
    • 0009048366 scopus 로고
    • Theoretical results on at most 1-bend embeddability of graphs. Technical report, Dipartimento di Statistica, Univ. di Roma
    • Y. Liu, P. Marchioro, R. Petreschi, and B. Simeone. Theoretical results on at most 1-bend embeddability of graphs. Technical report, Dipartimento di Statistica, Univ. di Roma "La Sapienza," 1990.
    • (1990) La Sapienza
    • Liu, Y.1    Marchioro, P.2    Petreschi, R.3    Simeone, B.4
  • 19
    • 0009046908 scopus 로고
    • General theoretical results on rectilinear embeddability of graphs
    • Y. Liu, A. Morgana, and B. Simeone. General theoretical results on rectilinear embeddability of graphs. Acta Math. Appl. Sinica, 7: 187-192, 1991.
    • (1991) Acta Math. Appl. Sinica , vol.7 , pp. 187-192
    • Liu, Y.1    Morgana, A.2    Simeone, B.3
  • 21
    • 0009000345 scopus 로고
    • Upward planarity testing of outerplanar dags
    • A. Papakostas. Upward planarity testing of outerplanar dags. In Proc. Graph Drawing '94, 1994.
    • (1994) Proc. Graph Drawing '94
    • Papakostas, A.1
  • 22
    • 0009008633 scopus 로고
    • Planar lattices and planar graphs
    • C. Platt. Planar lattices and planar graphs. J. Combin. Theory Ser. B, 21: 30-39, 1976.
    • (1976) J. Combin. Theory Ser. B , vol.21 , pp. 30-39
    • Platt, C.1
  • 23
    • 0008962406 scopus 로고
    • Reading, drawing, and order
    • I.G. Rosenberg and G. Sabidussi, editors,Kluwer Academic Publishers
    • I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pp. 359-404. Kluwer Academic Publishers, 1993.
    • (1993) Algebras and Orders , pp. 359-404
    • Rival, I.1
  • 25
    • 0021439251 scopus 로고
    • On minimal node-cost planar embeddings
    • J. A. Storer. On minimal node-cost planar embeddings. Networks, 14: 181-212, 1984.
    • (1984) Networks , vol.14 , pp. 181-212
    • Storer, J.A.1
  • 26
    • 0023366861 scopus 로고
    • On embedding a graph
    • the grid with the minimum number of bends
    • R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3): 421-444, 1987.
    • (1987) SIAM J. Comput , vol.16 , Issue.3 , pp. 421-444
    • Tamassia, R.1
  • 28
    • 0008962241 scopus 로고
    • Planar acyclic oriented graphs
    • C. Thomassen. Planar acyclic oriented graphs. Order, 5(4): 349-361, 1989.
    • (1989) Order , vol.5 , Issue.4 , pp. 349-361
    • Thomassen, C.1
  • 29
    • 0019532794 scopus 로고
    • Universality considerations
    • VLSI circuits
    • L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2): 135-140, 1981.
    • (1981) IEEE Trans. Comput , vol.C-30 , Issue.2 , pp. 135-140
    • Valiant, L.1
  • 30
    • 0022059741 scopus 로고
    • Rectilinear graphs and their embeddings
    • G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14: 355-372, 1985.
    • (1985) SIAM J. Comput , vol.14 , pp. 355-372
    • Vijayan, G.1    Wigderson, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.