Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.
Fedor V. FominDaniel LokshtanovSaket SaurabhMichal PilipczukMarcin WrochnaPublished in: ACM Trans. Algorithms (2018)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- polynomial time complexity
- matrix multiplication
- graph isomorphism
- conjunctive queries
- boolean functions
- search space
- computational complexity
- singular value decomposition
- pairwise comparison
- coefficient matrix
- kronecker product
- constraint graph
- planar graphs
- graph mining
- graphical models
- special case