Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
Douglas E. CarrollAshish GoelPublished in: CoRR (2008)
Keyphrases
- lower bound
- upper bound
- graph embedding
- min sum
- objective function
- graph theory
- directed acyclic graph
- nodes of a graph
- branch and bound algorithm
- branch and bound
- random walk
- directed graph
- probability distribution
- graph model
- graph representation
- lower and upper bounds
- graph structure
- graph mining
- optimal solution
- spectral embedding
- np hard
- constant factor
- power law
- vc dimension
- weighted graph
- nonlinear dimensionality reduction
- structured data
- bipartite graph
- graph matching
- random variables
- vector space