A linear time algorithm for finding tree-decompositions of small treewidth
Author:
Bodlaender Hans L.
Cited by
119 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Kempe changes in degenerate graphs;European Journal of Combinatorics;2023-11
2. On Imperfect Recall in Multi-Agent Influence Diagrams;Electronic Proceedings in Theoretical Computer Science;2023-07-11
3. An Improved Parameterized Algorithm for Treewidth;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. PTAS for Sparse General-valued CSPs;ACM Transactions on Algorithms;2023-03-09
5. Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth;Lecture Notes in Computer Science;2023