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

标题
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
作者
关键词
-
出版物
ACM Transactions on Algorithms
Volume 14, Issue 3, Pages 1-45
出版商
Association for Computing Machinery (ACM)
发表日期
2018-06-18
DOI
10.1145/3186898

向作者/读者发起求助以获取更多资源

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search