Login / Signup
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.
László Egri
Dániel Marx
Pawel Rzazewski
Published in:
STACS (2018)
Keyphrases
</>
bounded treewidth
np complete
graph theory
decision problems
graph theoretic
tractable cases
conjunctive queries
highly parallelizable
prior knowledge
query language
constraint satisfaction problems
complex networks
undirected graph
fixed parameter tractable