Publication:4633895
From MaRDI portal
zbMath1421.68125MaRDI QIDQ4633895
Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Daniel Lokshtanov
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496860
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
