Partitioning sparse graphs into an independent set and a forest of bounded degree.

François Dross Mickaël Montassier Alexandre Pinlou

Published in: CoRR (2016)

Keyphrases

independent set
bounded degree
maximum independent set
graph theoretic
maximum weight
high dimensional
graph partitioning
database
machine learning
weighted graph
bounded treewidth