DOULION: Counting Triangles in Massive Graphs with a Coin

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 257
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCharalampos E. Tsourakakis-
dc.contributor.authorKang, U-
dc.contributor.authorGary L. Miller-
dc.contributor.authorChristos Faloutsos-
dc.date.accessioned2014-12-09-
dc.date.available2014-12-09-
dc.date.created2014-01-13-
dc.date.issued2009-06-28-
dc.identifier.citationACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) 2009, v., no., pp. --
dc.identifier.urihttp://hdl.handle.net/10203/192232-
dc.languageENG-
dc.publisherACM-
dc.titleDOULION: Counting Triangles in Massive Graphs with a Coin-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.publicationnameACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) 2009-
dc.identifier.conferencecountryFrance-
dc.contributor.localauthorKang, U-
dc.contributor.nonIdAuthorCharalampos E. Tsourakakis-
dc.contributor.nonIdAuthorGary L. Miller-
dc.contributor.nonIdAuthorChristos Faloutsos-
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