•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Graft: An Efficient Graphlet Counting Method for Large Graph Analysis

Author:
Rahman, Mosaddequr
,
Bhuiyan, Mansurul /A/.
,
Al Hasan, Mohammad
Publisher:
IEEE
Year
: 2014
DOI: 10.1109/TKDE.2013.2297929
URI: http://libsearch.um.ac.ir:80/fum/handle/fum/965613
Keyword(s): graph theory,network theory (graphs),GFD,GRAFT algorithm,diameter,exact counting algorithm,excessive computation cost,global network topology,graph Laplacian spectra,graphlet counting method,graphlet frequency distribution,large graph analysis,local topological structures,network analysis study,power-law exponent,real-life graph properties,synthetic graphs,Accuracy,Algorithm design and analysis,Approximation algorithms,Approximation methods,Biology,Software algorithms,Topo
Collections :
  • Latin Articles
  • Show Full MetaData Hide Full MetaData
  • Statistics

    Graft: An Efficient Graphlet Counting Method for Large Graph Analysis

Show full item record

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
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
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace