Login / Signup

On the complexity of partitioning a graph into a few connected subgraphs.

Julien Bensmail
Published in: J. Comb. Optim. (2015)
Keyphrases
  • connected subgraphs
  • directed acyclic graph
  • graph partitioning
  • connected components
  • biological networks
  • partitioning algorithm
  • databases
  • graph theory
  • weighted graph
  • random walk
  • data structure
  • data management