메뉴 건너뛰기




Volumn 76, Issue 7, 2010, Pages 663-685

Hashing and canonicalizing Notation 3 graphs

Author keywords

Hash; Notation 3; RDF; Semantic Web

Indexed keywords

GRAPH STRUCTURES; GRAPHIC METHODS; HASH FUNCTIONS; SEMANTIC WEB;

EID: 77955430585     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.01.003     Document Type: Article
Times cited : (13)

References (20)
  • 4
    • 0014701097 scopus 로고
    • An efficient algorithm for graph isomorphism
    • D.G. Corneil, and C.C. Gotlieb An efficient algorithm for graph isomorphism J. ACM 17 1970 51 64
    • (1970) J. ACM , vol.17 , pp. 51-64
    • Corneil, D.G.1    Gotlieb, C.C.2
  • 5
    • 0003586162 scopus 로고
    • On Construction and Identification of Graphs
    • B. Weistfeiler, Springer
    • B. Weistfeiler, On Construction and Identification of Graphs Lecture Notes in Math. 1976 Springer
    • (1976) Lecture Notes in Math.
  • 7
    • 0004569294 scopus 로고
    • Group-Theoretic Algorithms and Graph Isomorphism
    • C. Hoffmann Group-Theoretic Algorithms and Graph Isomorphism Lecture Notes in Comput. Sci. vol. 136 1982
    • (1982) Lecture Notes in Comput. Sci. , vol.136
    • Hoffmann, C.1
  • 8
    • 48549112233 scopus 로고
    • A non-factorial algorithm for canonical numbering of a graph
    • D. Corneil, and M. Goldberg A non-factorial algorithm for canonical numbering of a graph J. Algorithms 5 1984 345 362
    • (1984) J. Algorithms , vol.5 , pp. 345-362
    • Corneil, D.1    Goldberg, M.2
  • 11
    • 0242337515 scopus 로고    scopus 로고
    • Sorting and Searching
    • 2nd edition Addison Wesley
    • D.E. Knuth Sorting and Searching 2nd edition The Art of Computer Programming vol. 3 1997 Addison Wesley
    • (1997) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 12
    • 77955421796 scopus 로고    scopus 로고
    • T. Berners-Lee CWM http://www.w3.org/2000/10/swap/doc/cwm.html, visited May 2009
    • CWM
    • Berners-Lee, T.1
  • 13
    • 0032186666 scopus 로고    scopus 로고
    • The TPTP problem library: CNF release v1.2.1
    • G. Sutcliffe, and C. Suttner The TPTP problem library: CNF release v1.2.1 J. Automat. Reason. 21 2 1998 177 203
    • (1998) J. Automat. Reason. , vol.21 , Issue.2 , pp. 177-203
    • Sutcliffe, G.1    Suttner, C.2
  • 16
    • 0006740356 scopus 로고    scopus 로고
    • Seminumerical Algorithms
    • 2nd edition Addison Wesley
    • D.E. Knuth Seminumerical Algorithms 2nd edition The Art of Computer Programming vol. 2 1997 Addison Wesley
    • (1997) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 20
    • 77955423516 scopus 로고    scopus 로고
    • Computing the digest of an RDF graph
    • Hewlett Packard Laboratories
    • C. Sayers, A. Karp, Computing the digest of an RDF graph, Tech. Rep. HPL-2003-235 (R. 1), Hewlett Packard Laboratories, 2004
    • (2004) Tech. Rep. HPL-2003-235 (R. 1)
    • Sayers, C.1    Karp, A.2


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