A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs.
Pinghui WangXiangliang ZhangZhenguo LiJiefeng ChengJohn C. S. LuiDon TowsleyJunzhou ZhaoJing TaoXiaohong GuanPublished in: CoRR (2016)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- complex networks
- connected components
- minimum cost
- graph structure
- disjoint paths
- random graphs
- spanning tree
- vertex set
- markov models
- strongly connected
- positive integer
- average degree
- multicommodity flow
- multi dimensional
- probabilistic model
- bayesian networks
- random walk
- hidden markov models
- image segmentation
- image processing