Author:
Grohe Martin,Wöhrle Stefan
Reference19 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. H.L. Bodlaender, NC-algorithms for graphs with small treewidth, in: J. van Leeuwen (Ed.), Proc. 14th Internat. Workshop on Graph Theoretic Concepts in Computer Science (WG’88), vol. 344, Lecture Notes in Computer Science, Springer, Berlin, 1988, pp. 1–10.
3. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
4. Graph Theory;Diestel,2000
5. Local properties of query languages;Dong;Theoret. Comput. Sci.,2000
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. When Locality Meets Preservation;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. The parameterized complexity of k-edge induced subgraphs;Information and Computation;2017-02
3. An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06
4. Subshifts as models for MSO logic;Information and Computation;2013-04
5. Game-based notions of locality over finite models;Annals of Pure and Applied Logic;2008-03