Back to Results
First PageMeta Content
NP-complete problems / Graph operations / Steiner tree problem / Treewidth / Edge contraction / Graph / Spanning tree / Graph connectivity / Minimum bottleneck spanning tree / Planar separator theorem


Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§
Add to Reading List

Document Date: 2016-01-03 06:47:29


Open Document

File Size: 556,38 KB

Share Result on Facebook