Graft: An Efficient Graphlet Counting Method for Large Graph Analysis

: 2014

یو آر آی: http://libsearch.um.ac.ir:80/fum/handle/fum/965613

کالکشن :

contributor author	Rahman, Mosaddequr
contributor author	Bhuiyan, Mansurul /A/.
contributor author	Al Hasan, Mohammad
date accessioned	2020-03-12T18:39:02Z
date available	2020-03-12T18:39:02Z
date issued	2014
identifier issn	1041-4347
identifier other	6702435.pdf
identifier uri	http://libsearch.um.ac.ir:80/fum/handle/fum/965613
format	general
language	English
publisher	IEEE
title	Graft: An Efficient Graphlet Counting Method for Large Graph Analysis
type	Journal Paper
contenttype	Metadata Only
identifier padid	7999299
subject keywords	graph theory
subject keywords	network theory (graphs)
subject keywords	GFD
subject keywords	GRAFT algorithm
subject keywords	diameter
subject keywords	exact counting algorithm
subject keywords	excessive computation cost
subject keywords	global network topology
subject keywords	graph Laplacian spectra
subject keywords	graphlet counting method
subject keywords	graphlet frequency distribution
subject keywords	large graph analysis
subject keywords	local topological structures
subject keywords	network analysis study
subject keywords	power-law exponent
subject keywords	real-life graph properties
subject keywords	synthetic graphs
subject keywords	Accuracy
subject keywords	Algorithm design and analysis
subject keywords	Approximation algorithms
subject keywords	Approximation methods
subject keywords	Biology
subject keywords	Software algorithms
subject keywords	Topo
identifier doi	10.1109/TKDE.2013.2297929
journal title	Knowledge and Data Engineering, IEEE Transactions on
journal volume	26
journal issue	10
filesize	1674799
citations	0

Show full item record