Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.
Lars JaffkeBart M. P. JansenPublished in: CoRR (2017)
Keyphrases
- complexity analysis
- fine grained
- graph coloring problems
- constraint satisfaction problems
- scheduling problem
- coarse grained
- satisfiability problem
- lower bound
- theoretical analysis
- first order logic
- access control
- constraint satisfaction
- data lineage
- computational complexity
- massively parallel
- search engine
- tightly coupled
- knowledge base
- security policies
- databases
- np complete
- knowledge representation
- search space