Searching for "Algorithms for Multiterminal Cuts." – sorted by Relevance.
-
The Complexity of Multiterminal Cuts
- . There is an O(knmlog(n 2 /m)) approximation algorithm for the Multiterminal Cut problem that for arbitrary
- Cited by 87 (0 self) – Add To MetaCart
-
Almost 2-sat is fixed-parameter tractable. To appear in
- by the author allowed him to design fixedparameter algorithms for the multiterminal cut problem and for a more
- Cited by 2 (0 self) – Add To MetaCart
-
Some Issues in Design of Distributed Deductive Databases
- , then the approximation algorithm of multiterminal cut problem could have been used for rule allocation. The detailed
- Cited by 1 (0 self) – Add To MetaCart

