Login / Signup

On the complexity of the multicut problem in bounded tree-width graphs and digraphs.

Cédric Bentz
Published in: Discret. Appl. Math. (2008)
Keyphrases
  • tree width
  • bounded tree width
  • directed graph
  • search algorithm
  • graph matching