Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.
Fedor V. FominGeevarghese PhilipYngve VillangerPublished in: FSTTCS (2011)
Keyphrases
- spanning tree
- sparse approximation
- gaussian graphical models
- graph theory
- high dimensional
- directed acyclic
- graph structure
- connected dominating set
- sparse data
- graph matching
- sparse representation
- graph model
- compressive sensing
- approximation error
- approximation methods
- error bounds
- sparse approximations
- random graphs
- minimum cost
- approximation algorithms
- directed graph
- linear combination