Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.
Lars JaffkeBart M. P. JansenPublished in: CIAC (2017)
Keyphrases
- complexity analysis
- fine grained
- graph coloring problems
- constraint satisfaction problems
- satisfiability problem
- coarse grained
- scheduling problem
- theoretical analysis
- lower bound
- access control
- computational complexity
- tightly coupled
- first order logic
- constraint satisfaction
- massively parallel
- np complete
- search engine
- information retrieval
- expert systems
- database
- search algorithm
- data lineage
- databases