메뉴 건너뛰기




Volumn 1644 LNCS, Issue , 1999, Pages 321-330

Partially ordered regular languages for graph queries

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

EID: 84887422509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_29     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 4
    • 84887474532 scopus 로고    scopus 로고
    • Altavista Help, http://www.altavista.com/av/content/help.htm.
    • Altavista Help
  • 10
    • 0029333530 scopus 로고
    • Logical foundation of object-oriented and frame based languages
    • Kifer, M., G. Lausen, J. Wu, Logical Foundation of Object-Oriented and Frame Based Languages., Journal of ACM, 42(4), pages 741-843, 1995.
    • (1995) Journal of ACM , vol.42 , Issue.4 , pp. 741-843
    • Kifer, M.1    Lausen, G.2    Wu, J.3
  • 11
    • 84867524779 scopus 로고
    • Finding regular simple path in graph databases
    • Mendelzon A., P.T. Wood, Finding Regular Simple Path in Graph Databases, SIAM Journal on Computing, 24(6), 1995.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.6
    • Mendelzon, A.1    Wood, P.T.2
  • 15
    • 0019587817 scopus 로고
    • Fast algorithms for solving path problems
    • Tarjan R., Fast Algorithms for Solving Path Problems, Journal of ACM, 28, pages 594-614, 1981.
    • (1981) Journal of ACM , vol.28 , pp. 594-614
    • Tarjan, R.1


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