Login / Signup
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.
Fedor V. Fomin
Daniel Lokshtanov
Michal Pilipczuk
Saket Saurabh
Marcin Wrochna
Published in:
CoRR (2015)
Keyphrases
</>
bounded treewidth
np complete
decision problems
conjunctive queries
matrix multiplication
upper bound
boolean functions
graph isomorphism
linear algebra
polynomial time complexity
search space
constraint graph
kronecker product
relational learning
graph matching
directed graph
singular value decomposition