✦ LIBER ✦
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
✍ Scribed by Broersma, Hajo; Golovach, Petr A.; Patel, Viresh
- Book ID
- 122073170
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 591 KB
- Volume
- 485
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.