An Efficient Path-based Indexing Technique for Subgraph Isomorphism Query Processing

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 198
  • Download : 0
DC FieldValueLanguage
dc.contributor.author하태욱ko
dc.contributor.author김명호ko
dc.date.accessioned2018-01-22T02:36:55Z-
dc.date.available2018-01-22T02:36:55Z-
dc.date.created2017-12-22-
dc.date.created2017-12-22-
dc.date.issued2017-06-19-
dc.identifier.citation2017 한국컴퓨터종합학술대회, pp.310 - 312-
dc.identifier.urihttp://hdl.handle.net/10203/237502-
dc.languageEnglish-
dc.publisher한국정보과학회-
dc.titleAn Efficient Path-based Indexing Technique for Subgraph Isomorphism Query Processing-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage310-
dc.citation.endingpage312-
dc.citation.publicationname2017 한국컴퓨터종합학술대회-
dc.identifier.conferencecountryKO-
dc.identifier.conferencelocation라마다 프라자 제주호텔-
dc.contributor.localauthor김명호-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0