Uniform upper bound of the spectrum of rooted graphs.
Chao HuangQingchen LiuChangbin YuPublished in: AuCC (2016)
Keyphrases
- upper bound
- lower bound
- worst case
- graph matching
- branch and bound algorithm
- linear array
- series parallel
- graph theory
- graph representation
- complex structures
- branch and bound
- graph mining
- graph isomorphism
- lower and upper bounds
- upper and lower bounds
- power spectrum
- error probability
- generalization error
- graph structure
- directed graph
- np hard
- real time
- random walk
- graph theoretic
- similarity measure
- case study
- subgraph isomorphism
- data mining
- data sets
- database