Decomposition of sparse graphs into two forests, one having bounded maximum degree.
Mickaël MontassierAndré RaspaudXuding ZhuPublished in: Inf. Process. Lett. (2010)
Keyphrases
- tensor decomposition
- high dimensional
- gaussian graphical models
- random graphs
- structural learning
- bounded treewidth
- sparse data
- graph databases
- graph theory
- decomposition method
- graph representation
- graph theoretic
- power law
- series parallel
- compressive sensing
- wavelet packet
- graph structures
- maximum number
- degree distribution
- directed graph
- graph mining
- neural network