Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna. Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Transactions on Algorithms, 14(3), 2018. [doi]

Abstract

Abstract is missing.