Login / Signup

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.

Takehiro ItoXiao ZhouTakao Nishizeki
Published in: J. Discrete Algorithms (2006)
Keyphrases
  • connected subgraphs
  • tree width
  • directed acyclic graph
  • biological networks
  • connected components
  • directed graph
  • tree decomposition
  • computational complexity
  • databases
  • pairwise
  • markov networks