Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002

Min Cut Linear Arrangement, Independet Set, Vertex Cover and Dominating Set.The last two problems are de ned

Cited by 2,836 works. doi:10.1016/s1571-0661(04)00301-9 Open-access PDF

Authors

References