Partitioning sparse graphs into an independent set and a graph with bounded size components.
Ilkyoo ChoiFrançois DrossPascal OchemPublished in: CoRR (2019)
Keyphrases
- independent set
- maximum independent set
- bounded degree
- maximum weight
- bounded treewidth
- graph partitioning
- graph theory
- graph matching
- maximal cliques
- special case
- random walk
- gaussian graphical models
- weighted graph
- maximum clique
- graph theoretic
- graph representation
- partitioning algorithm
- graph clustering
- computational complexity
- graph model
- graph structure
- bipartite graph
- high dimensional