Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
Min ChenSeog-Jin KimAlexandr V. KostochkaDouglas B. WestXuding ZhuPublished in: J. Comb. Theory, Ser. B (2017)
Keyphrases
- graph structure
- structural learning
- spanning tree
- tensor decomposition
- minimum spanning tree
- tree structured data
- index structure
- directed acyclic
- reachability queries
- minimum spanning trees
- maximal cliques
- binary tree
- sparse data
- graph databases
- tree structure
- directed graph
- graph representation
- weighted graph
- constraint graph
- decomposition method
- graph mining
- high dimensional
- sparse representation
- subgraph isomorphism
- sparse coding
- graph theory
- compressive sensing
- graph theoretic
- graph matching
- b tree
- hierarchical structure
- leaf nodes
- graph model