메뉴 건너뛰기




Volumn 1731, Issue , 1999, Pages 359-368

Rectangle of influence drawings of graphs without filled 3-cycles?

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH THEORY; GRAPHIC METHODS;

EID: 84958980924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_37     Document Type: Conference Paper
Times cited : (28)

References (10)
  • 2
    • 23844554331 scopus 로고    scopus 로고
    • On triangulating planar graphs under the four-connectivity constraint
    • T. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19(4):427-446, 1997.
    • (1997) Algorithmica , vol.19 , Issue.4 , pp. 427-446
    • Biedl, T.1    Kant, G.2    Kaufmann, M.3
  • 7
    • 0022241816 scopus 로고
    • The relative neighborhood graph for mixed feature variables
    • M. Ichino and J. Sklansky. The relative neighborhood graph for mixed feature variables. Pattern Recognition, 18(2):161-167, 1985.
    • (1985) Pattern Recognition , vol.18 , Issue.2 , pp. 161-167
    • Ichino, M.1    Sklansky, J.2


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