Show simple item record

Graft: An Efficient Graphlet Counting Method for Large Graph Analysis

contributor authorRahman, Mosaddequr
contributor authorBhuiyan, Mansurul /A/.
contributor authorAl Hasan, Mohammad
date accessioned2020-03-12T18:39:02Z
date available2020-03-12T18:39:02Z
date issued2014
identifier issn1041-4347
identifier other6702435.pdf
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/965613?show=full
formatgeneral
languageEnglish
publisherIEEE
titleGraft: An Efficient Graphlet Counting Method for Large Graph Analysis
typeJournal Paper
contenttypeMetadata Only
identifier padid7999299
subject keywordsgraph theory
subject keywordsnetwork theory (graphs)
subject keywordsGFD
subject keywordsGRAFT algorithm
subject keywordsdiameter
subject keywordsexact counting algorithm
subject keywordsexcessive computation cost
subject keywordsglobal network topology
subject keywordsgraph Laplacian spectra
subject keywordsgraphlet counting method
subject keywordsgraphlet frequency distribution
subject keywordslarge graph analysis
subject keywordslocal topological structures
subject keywordsnetwork analysis study
subject keywordspower-law exponent
subject keywordsreal-life graph properties
subject keywordssynthetic graphs
subject keywordsAccuracy
subject keywordsAlgorithm design and analysis
subject keywordsApproximation algorithms
subject keywordsApproximation methods
subject keywordsBiology
subject keywordsSoftware algorithms
subject keywordsTopo
identifier doi10.1109/TKDE.2013.2297929
journal titleKnowledge and Data Engineering, IEEE Transactions on
journal volume26
journal issue10
filesize1674799
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record