Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Daniel Lokshtanov, Dániel Marx, Saket Saurabh

Journal title: ACM Transactions on Algorithms

Journal number: 14/2

Journal publisher: Association for Computing Machinary, Inc.

Published year: 2018

Published pages: 1-30

DOI identifier: 10.1145/3170442

ISSN: 1549-6325