메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Software and algorithms for graph queries on multithreaded architectures

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COMPUTER SOFTWARE; DATA PROCESSING; GRAPH THEORY; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SEMANTICS;

EID: 34548755221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370685     Document Type: Conference Paper
Times cited : (69)

References (9)
  • 2
    • 34548805769 scopus 로고
    • Pattern associativity and the retrieval of semantic networks
    • R. Levinson. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 23:573600, 1992.
    • (1992) Computers and Mathematics with Applications , vol.23 , pp. 573600
    • Levinson, R.1
  • 3
    • 0002603293 scopus 로고
    • Practical graph isomorphism
    • Brendan McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1980.
    • (1980) Congressus Numerantium , vol.30 , pp. 45-87
    • McKay, B.1
  • 4
    • 0001231350 scopus 로고
    • A subgraph isomorphism theorem for molecular graphs
    • Stud. Phys. Theoret. Chem, Elsevier
    • V. Nicholson, C.-C. Tsai, M. Johnson, and M. Naim. A subgraph isomorphism theorem for molecular graphs. In Graph Theory and Topology in Chemistry, number 51 in Stud. Phys. Theoret. Chem., pages 226-230. Elsevier, 1987.
    • (1987) Graph Theory and Topology in Chemistry , Issue.51 , pp. 226-230
    • Nicholson, V.1    Tsai, C.-C.2    Johnson, M.3    Naim, M.4
  • 5
    • 49049132956 scopus 로고
    • An o(n log n) parallel connectivity algorithm
    • Y. Shiloach and U. Vishkin. An o(n log n) parallel connectivity algorithm. J. Algorithms, 3(7):57-67, 1982.
    • (1982) J. Algorithms , vol.3 , Issue.7 , pp. 57-67
    • Shiloach, Y.1    Vishkin, U.2
  • 7
    • 0016870630 scopus 로고    scopus 로고
    • An algorithm for subgraph isomorphism
    • Mach
    • J. R. Ullmann. An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach., 23:31-42, 1976.
    • J. Assoc. Comput , vol.23 , Issue.31-42 , pp. 1976
    • Ullmann, J.R.1
  • 9
    • 33845388971 scopus 로고    scopus 로고
    • A scalable distributed parallel breadth-first search algorithm on BlueGene/L
    • November, Finalist for the Gordon Bell Prize
    • A. Yoo, E. Chow, K. Henderson, W. McLendon III, B. Hendrickson, and U. Çatalyürek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Proc. SC'05, November 2005. Finalist for the Gordon Bell Prize.
    • (2005) Proc. SC'05
    • Yoo, A.1    Chow, E.2    Henderson, K.3    McLendon III, W.4    Hendrickson, B.5    Çatalyürek, U.6


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