Incremental FPT Delay
In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt-time in terms of exponent slices and show how the...
Main Author: | Arne Meier |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/5/122 |
Similar Items
-
Parameterised Enumeration for Modification Problems
by: Nadia Creignou, et al.
Published: (2019-09-01) -
Microscopic Structural Analysis of Complex Networks: An Empirical Study Using Motifs
by: Lekshmi S. Nair, et al.
Published: (2022-01-01) -
Topics in computational complexity
by: Farr, G, et al.
Published: (1986) -
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
by: Andreas Emil Feldmann, et al.
Published: (2020-06-01) -
A Brief Survey of Fixed-Parameter Parallelism
by: Faisal N. Abu-Khzam, et al.
Published: (2020-08-01)