Fine-grained parameterized complexity analysis of graph coloring problems.
Lars JaffkeBart M. P. JansenPublished in: Discret. Appl. Math. (2023)
Keyphrases
- complexity analysis
- fine grained
- graph coloring problems
- constraint satisfaction problems
- scheduling problem
- satisfiability problem
- coarse grained
- theoretical analysis
- lower bound
- access control
- first order logic
- tightly coupled
- computational complexity
- constraint satisfaction
- search algorithm
- temporal logic
- databases
- data lineage
- phase transition
- massively parallel
- search space
- relational databases
- database