Partitioning sparse graphs into an independent set and a graph with bounded size components.
Ilkyoo ChoiFrançois DrossPascal OchemPublished in: Discret. Math. (2020)
Keyphrases
- independent set
- maximum independent set
- bounded degree
- maximum weight
- bounded treewidth
- graph partitioning
- graph theory
- partitioning algorithm
- spectral graph
- graph theoretic
- graph representation
- computational complexity
- maximal cliques
- weighted graph
- directed graph
- directed acyclic
- gaussian graphical models
- high dimensional