Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
| Year of publication: |
2008
|
|---|---|
| Authors: | Guo, Jiong ; Hüffner, Falk ; Kenar, Erhan ; Niedermeier, Rolf ; Uhlmann, Johannes |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 186.2008, 2, p. 542-553
|
Saved in:
Saved in favorites
Similar items by person
-
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Guo, Jiong, (2008)
-
Separator-based data reduction for signed graph balancing
Hüffner, Falk, (2010)
-
Algorithms for compact letter displays: Comparison and evaluation
Gramm, Jens, (2007)
- More ...