Multiway cut and integer flow problems in trees

  • Costa M
  • Billionnet A
  • 3


    Mendeley users who have this article in their library.
  • 9


    Citations of this article.


Let T = (V, E) be a n-vertices undirected tree and X ⊂ V a set of terminal vertices. We consider the well-know multway cut problem to which we associate the problem of finding an integral multiway flow maximizing the flow routed between all pair of terminals. These problems are special cases of multicut and integral multiflow problems which are know to be NP-hard in tress. We propose a generic procedure to explore and reduce a tree, which allows to devise an O (n) procedure for the multiway cut and an O (n2) procwdure for the integral multiway flow in trees. Efficient procedured are also proposed to solve the problems in directed trees. © 2004.

Author-supplied keywords

  • multiterminal cut
  • multiway cut
  • multiway flow
  • tree

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Marie Christine Costa

  • Alain Billionnet

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free