Author:
Bodlaender Hans L.,Cygan Marek,Kratsch Stefan,Nederlof Jesper
Funder
NCN
Foundation for Polish Science
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference59 articles.
1. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth;Bodlaender,2013
2. Graph minors, III: planar tree-width;Robertson;J. Comb. Theory, Ser. B,1984
3. Treewidth: structure and algorithms;Bodlaender,2007
4. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
5. The monadic second-order logic of graphs, I: recognizable sets of finite graphs;Courcelle;Inf. Comput.,1990
Cited by
141 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献