The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications-Reference-Cited by-同舟云学术

The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications

Published:2003-04 Issue:1-3 Volume:299 Page:1-36
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Courcelle Bruno

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. M. Ajtai, R. Fagin, L. Stockmeyer, The closure of monadic NP, 13th STOC, 1998 (and IBM Research Report RJ 10092, 1997).

2. A partial k-arboretum of graphs with bounded tree-width;Bodlaender;Theoret. Comput. Sci.,1998

3. Extremal Graph Theory;Bollobas,1978

4. B. Bollobas, Extremal graph theory in: R. Graham, et al. (Eds.), Handbook of Combinatorics, vol. 2, Amsterdam, Elsevier, 1997, pp. 1232–1292.

5. D. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time algorithm for the clique-width 3 problem, in: LATIN 2000, Proceedings, Lec. Notes Comput. Sci. 1776 (2000) pp. 126–134

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SIMPLIFIED ALGORITHMIC METATHEOREMS BEYOND MSO: TREEWIDTH AND NEIGHBORHOOD DIVERSITY;LOG METH COMPUT SCI;2019

2. Meta-kernelization using well-structured modulators;Discrete Applied Mathematics;2018-10

3. Improved approximation algorithms for weighted 2-path partitions;Discrete Applied Mathematics;2018-04

4. Order Invariance on Decomposable Structures;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

5. Model Counting for CNF Formulas of Bounded Modular Treewidth;Algorithmica;2015-07-17