Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference17 articles.
1. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theor. Comput. Sci.,1998
2. Improved upper bounds for planarization and series-parallelization of average degree bounded graphs;Edwards;Electron. J. Comb.,2012
3. A general reduction theorem with applications to pathwidth and the complexity of MAX 2-CSP;Edwards;Algorithmica,2015
4. Pathwidth of cubic graphs and exact algorithms;Fomin;Inf. Process. Lett.,2006
5. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between;Gaspers;J. Comput. Syst. Sci.,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs;SIAM Journal on Discrete Mathematics;2018-01
2. Separate, Measure and Conquer;ACM Transactions on Algorithms;2017-10-31