메뉴 건너뛰기




Volumn 2719, Issue , 2003, Pages 739-750

Similarity matrices for pairs of graphs

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPHIC METHODS; ITERATIVE METHODS; WEBSITES;

EID: 35248897049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_58     Document Type: Article
Times cited : (5)

References (11)
  • 2
    • 80053392809 scopus 로고    scopus 로고
    • Automatic extraction of synonyms in a dictionary
    • Technical report 2001-89, Université catholique de Louvain, Louvain-la-Neuve, Belgium. Arlington (Virginia, USA) April 11
    • Vincent D. Blondel, Pierre P. Senellart, Automatic extraction of synonyms in a dictionary, Technical report 2001-89, Université catholique de Louvain, Louvain-la-Neuve, Belgium. Also: Proceedings of the SIAM Text Mining Workshop, Arlington (Virginia, USA) April 11, 2002.
    • (2002) Proceedings of the SIAM Text Mining Workshop
    • Blondel, V.D.1    Senellart, P.P.2
  • 7
    • 11344253193 scopus 로고
    • Connectedness of products of two directed graphs
    • Frank Harary, C. Trauth, Connectedness of products of two directed graphs, J. SIAM Appl. Math., 14, pp. 150-154, 1966.
    • (1966) J. SIAM Appl. Math. , vol.14 , pp. 150-154
    • Harary, F.1    Trauth, C.2
  • 10
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • Jon M. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM, 46:5, pp. 604-632, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1


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