메뉴 건너뛰기




Volumn 1858, Issue , 2000, Pages 85-94

Rectangular drawings of plane graphs without designated corners

Author keywords

Algorithm; Graph; Graph drawing; Rectangular drawing

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; DRAWING (GRAPHICS);

EID: 33750710008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_9     Document Type: Conference Paper
Times cited : (3)

References (9)
  • 1
    • 0004688398 scopus 로고
    • A linear algorithm to find a rectangular dual of a planar triangulated graph
    • J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3 (1988), pp. 247-278.
    • (1988) Algorithmica , vol.3 , pp. 247-278
    • Bhasker, J.1    Sahni, S.2
  • 3
    • 0027833068 scopus 로고
    • On finding the rectangular duals of planar triangulated graphs
    • X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22(6) (1993), pp. 1218-1226.
    • (1993) SIAM J. Comput. , vol.22 , Issue.6 , pp. 1218-1226
    • He, X.1
  • 4
    • 0039443354 scopus 로고
    • An efficient parallel algorithm for finding rectangular duals of plane triangulated graphs
    • X. He, An efficient parallel algorithm for finding rectangular duals of plane triangulated graphs, Algorithmica 13 (1995), pp. 553-572.
    • (1995) Algorithmica , vol.13 , pp. 553-572
    • He, X.1
  • 5
    • 0031069913 scopus 로고    scopus 로고
    • Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
    • G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172 (1997), pp. 175-193.
    • (1997) Theoretical Computer Science , vol.172 , pp. 175-193
    • Kant, G.1    He, X.2
  • 6
    • 0021197558 scopus 로고
    • An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits
    • Albuquerque, June
    • K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. 21st DAC, Albuquerque, June (1984), pp. 655-656.
    • (1984) Proc. 21st DAC , pp. 655-656
    • Kozminski, K.1    Kinnen, E.2
  • 9
    • 0013361447 scopus 로고
    • Plane representations of graphs
    • J. A. Bondy and U. S. R. Murty, Academic Press Canada
    • C. Thomassen, Plane representations of graphs, (Eds.) J. A. Bondy and U. S. R. Murty, Progress in Graph Theory, Academic Press Canada, (1984), pp. 43-69.
    • (1984) Progress in Graph Theory , pp. 43-69
    • Thomassen, C.1


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