An Efficient Traversal Algorithm of DFS, BFS for Large Hypergraphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 415
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorRyu, Choong Moko
dc.contributor.authorSeo, Jung Hyukko
dc.contributor.authorKim, Myoung Hoko
dc.date.accessioned2017-05-15T05:12:06Z-
dc.date.available2017-05-15T05:12:06Z-
dc.date.created2017-05-05-
dc.date.issued2016-12-22-
dc.identifier.citation2016 KIISE Winter Conference, pp.205 - 207-
dc.identifier.issn2466-0825-
dc.identifier.urihttp://hdl.handle.net/10203/223638-
dc.languageEnglish-
dc.publisher한국정보과학회-
dc.titleAn Efficient Traversal Algorithm of DFS, BFS for Large Hypergraphs-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage205-
dc.citation.endingpage207-
dc.citation.publicationname2016 KIISE Winter Conference-
dc.identifier.conferencecountryKO-
dc.identifier.conferencelocation강원도 보광휘닉스파크-
dc.contributor.localauthorKim, Myoung Ho-
dc.contributor.nonIdAuthorRyu, Choong Mo-
dc.contributor.nonIdAuthorSeo, Jung Hyuk-
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