Graph operations and monadic second-order logic: a survey

Authors:
Bruno Courcelle
Affiliations:
LaBRI, CNRS, UMR, Université Bordeaux-I, Talence, France
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 3
Cited 2

The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics

Treewidth and logical definability of graph products

Theoretical Computer Science
Nondeterministic streaming string transducers

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.