Sparse Additive Spanners for Bounded Tree-Length Graphs.
Yon DourisboureCyril GavoillePublished in: SIROCCO (2004)
Keyphrases
- bounded degree
- spanning tree
- graph structure
- minimum spanning tree
- directed acyclic
- tree structured data
- graph matching
- minimum spanning trees
- tree structure
- additive models
- graph theoretic
- gaussian graphical models
- binary tree
- tree structures
- index structure
- high dimensional
- r tree
- graph mining
- bounded treewidth
- sparse representation
- tree search
- reachability queries
- feature selection
- b tree
- dimensionality reduction
- graphical models
- arbitrary length
- xml documents
- graph theory
- face recognition
- subgraph isomorphism
- maximal cliques
- graph kernels
- random graphs
- directed graph
- small world
- compressive sensing
- sparse data
- graph representation
- graph partitioning
- graph model