메뉴 건너뛰기




Volumn 21, Issue 6, 2000, Pages 761-766

A Note on Distance Approximating Trees in Graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0034410991     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1999.0381     Document Type: Article
Times cited : (40)

References (2)
  • 1
    • 0009188832 scopus 로고    scopus 로고
    • Distance approximating trees for chordal and dually chordal graphs
    • A. Brandstädt, V. Chepoi and F. Dragan, Distance approximating trees for chordal and dually chordal graphs, J. Algorithms, 30 (1999), 166-184.
    • (1999) J. Algorithms , vol.30 , pp. 166-184
    • Brandstädt, A.1    Chepoi, V.2    Dragan, F.3
  • 2
    • 0003352567 scopus 로고
    • Les Groupes Hyperboliques d'après Mikhael Gromov
    • E. Ghys and P. de la Harpe, Les Groupes Hyperboliques d'après Mikhael Gromov, Prog. Math., 83 (1990).
    • (1990) Prog. Math. , vol.83
    • Ghys, E.1    De La Harpe, P.2


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