Parameterized Complexity of Conflict-Free Matchings and Paths.

Akanksha Agrawal Pallavi Jain Lawqueen Kanesh Saket Saurabh

Published in: Algorithmica (2020)

Keyphrases

conflict free
parameterized complexity
functional dependencies
database schemes
fixed parameter tractable
global constraints
computational problems
argumentation frameworks
multivalued dependencies
shortest path
symmetry breaking
reinforcement learning
multi agent
np hard
bounded treewidth