DSpace at KOASAS
College of Engineering(공과대학)Dept. of Bio and Brain Engineering(바이오및뇌공학과)BiS-Conference Papers(학술회의논문)

Efficient mining of frequent subgraph with connectivity constraint

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 352
  • Download : 0
Export
DC FieldValueLanguage
dc.contributor.authorLee, Doheon-
dc.contributor.authorLee, Kwang-Hyung-
dc.date.accessioned2013-03-17T01:55:05Z-
dc.date.available2013-03-17T01:55:05Z-
dc.date.created2012-02-06-
dc.date.issued2005-
dc.identifier.citationBIOINFO 2005, v., no., pp.267 - 271-
dc.identifier.urihttp://hdl.handle.net/10203/138569-
dc.languageENG-
dc.titleEfficient mining of frequent subgraph with connectivity constraint-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage267-
dc.citation.endingpage271-
dc.citation.publicationnameBIOINFO 2005-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthorLee, Doheon-
dc.contributor.localauthorLee, Kwang-Hyung-
Appears in Collection
BiS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0