Fully polynomial-time parameterized computations for graphs and matrices of low treewidth

DOI10.1137/1.9781611974782.92zbMath1410.05201MaRDI QIDQ4575835

Fedor V. Fomin, Saket Saurabh, Michał Pilipczuk, Daniel Lokshtanov, Marcin Wrochna

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.92

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C85: Graph algorithms (graph-theoretic aspects)