4 search results - page 1 / 1 » The monadic second-order logic of graphs XVI : Canonical gra... |
LMCS
2006
13 years 5 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
JAPLL
2008
13 years 5 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
POPL
1993
ACM
13 years 9 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...