Abstract
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many
Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many
441
Views
7
Downloads
2
Crossref
N/A
Web of Science
2
Scopus
0
CSCD
Altmetrics