Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.
Fedor V. FominGeevarghese PhilipYngve VillangerPublished in: Algorithmica (2015)
Keyphrases
- sparse approximation
- spanning tree
- sparse data
- gaussian graphical models
- directed acyclic
- graph matching
- linear combination
- connected dominating set
- approximation error
- graph theoretic
- graph mining
- graph representation
- minimum cost
- approximation algorithms
- compressive sensing
- graph kernels
- error bounds
- pattern mining
- closed form
- high dimensional