Graph Structure and Monadic Second-Order Logic

Graph Structure and Monadic Second-Order Logic (2010)

Cached

Download Links

by Bruno Courcelle

Citations:

BibTeX

@MISC{Courcelle10graphstructure,
    author = {Bruno Courcelle},
    title = {Graph Structure and Monadic Second-Order Logic},
    year = {2010}
}

Bookmark

OpenURL

Abstract

Citations

991	Algorithmic Graph Theory and Perfect Graphs - Golumbic - 1980
929	Modern Graph Theory - Bollobas - 1998
823	T.Nipkow : Term Rewriting and All That - Baader - 1998
723	Rewrite systems - Dershowitz, Jouannaud - 1990
697	Fellows M: Parameterized Complexity - Downey - 1999
431	Finite Model Theory - Ebbinghaus, Flum - 1999
267	Complexity of finding embeddings in a k-tree - Arnborg, Corneil, et al. - 1987
247	Graph Coloring Problems - Toft - 1995
239	Y.: The Classical Decision Problem - Börger, Grädel, et al. - 1996
228	Parameterized Complexity Theory - Flum, Grohe - 2006
214	Graph minors. XIII. The disjoint paths problem - Robertson, Seymour - 1995
211	A partial k-arboretum of graphs with bounded treewidth - Bodlaender - 1998
203	Easy problems for treedecomposable graphs - Arnborg, Lagergren, et al. - 1991
200	Analytic Combinatorics - Flajolet, Sedgewick - 2009
167	A tourist guide through treewidth - Bodlaender - 1993
138	A linear-time algorithm for finding tree-decompositions of small treewidth - Bodlaender - 1996
127	The expression of graph properties and graph transformations in monadic second-order logic - Courcelle
126	Graph Theory - Tutte - 1984
102	Transductions and Context-Free Languages, Teubner - Berstel - 1979
65	Query evaluation via tree-decompositions - Flum, Frick, et al.
64	Deciding first-order properties of locally tree-decomposable structures - Frick, Grohe
63	An algebraic theory of graph reduction - Arnborg, Courcelle, et al. - 1993
63	Monadic second-order evaluations on tree-decomposable graphs, Theoret - Courcelle, Mosbah - 1993
57	Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families - Borie, Parker, et al. - 1992
55	Efficient Graph Representations - Spinrad - 2003
49	On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic - Courcelle, Makowsky, et al. - 2001
49	Finding approximate separators and computing treewidth quickly - Reed - 2008
45	Improved approximation algorithms for minimum weight vertex separators - Feige, Hajiaghayi, et al.
44	The complexity of first-order and monadic second-order logic revisited - Frick, Grohe - 2002
42	Approximating clique-width and branch-width - Oum, Seymour
41	Rudiments of µ-calculus - Arnold, Niwiński - 2001
41	Graph minors IV. Tree-width and wellquasi-ordering - Robertson, Seymour - 1990
38	Efficient and constructive algorithms for the pathwidth and treewidth of graphs - Bodlaender, Kloks - 1996
37	Graph Classes: A - Brandstädt, Le, et al. - 1999
35	Algorithmic uses of the Feferman–Vaught theorem - Makowsky
30	Polynomial time recognition of clique-width �3 graphs - Corneil, Habib, et al. - 2000
27	k-NLC graphs and polynomial algorithms - Wanke - 1994
25	Equivalences and Transformations of Regular Systems applications to - Courcelle - 1986
25	Hardware verification using monadic second-order logic - Basin, Klarlund - 1995
24	Finding branch-decompositions and rankdecompositions - Hliněn´y, Oum
23	Approximating rank-width and clique-width quickly - Oum - 2005
22	Graph Grammars and Tree Transducers, in - Engelfriet
20	Graph theory, third edition - Diestel - 2005
20	Achromatic number is NP-complete for cographs and interval graphs - Bodlaender - 1989
20	On some variants of the bandwidth minimization problem - Leung, Vornberger, et al. - 1984
19	Fundamental properties of infinite trees. Theoretical Computer Science 25(2):95–169 - Courcelle - 1983
18	The calculus of computation: decision procedures with applications to verification, volume 374 - Bradley, Manna - 2007
18	Clique-width minimization is NP-hard - Fellows, Rosamond, et al. - 2006
16	Treewidth: characterizations, applications, and computations - Bodlaender
16	Query Efficient Implementation of Graphs of Bounded Clique-width. Discrete Applied Mathematics - Courcelle, Vanicat - 2003