Sciweavers

Share
CPM
2008
Springer

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

8 years 4 months ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CPM
Authors Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
Comments (0)
books