Results 1  10
of
118,640
The modular decomposition of countable graphs: Constructions in Monadic SecondOrder Logic
 IN COMPUTER SCIENCE LOGIC 2005, VOLUME 3634 OF OXFORD, LEC. NOTES COMPUT. SCI
, 2005
"... 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 SecondOrder logic. A second main result is the definition of a representation of modular decompositions by a low degree relational st ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
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 SecondOrder logic. A second main result is the definition of a representation of modular decompositions by a low degree relational
Circle graphs and Monadic Secondorder logic
, 2005
"... 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 representation as a set of intersecting chords, and we prove that this representation can be defined by monadic secondorder ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
formulas. By using the (canonical) split decomposition of a circle graph, one can define in monadic secondorder logic all its chord representations formalized as words with two occurrences of each letter. This construction uses the general result that the split decomposition of a graph can be constructed
The monadic secondorder logic of graphs XVI: Canonical graph decompositions
 Logical Methods in Computer Science
, 2006
"... ..."
MONADIC SECONDORDER DEFINABLE GRAPH ORDERINGS
 VOL. 10(1:2)2014, PP. 1–36 WWW.LMCSONLINE.ORG
, 2014
"... ..."
Monadic second–order evaluations on treedecomposable graphs
 Theoret. Comput. Sci
, 1993
"... Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs, ..."
Abstract

Cited by 90 (25 self)
 Add to MetaCart
Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs,
Quantitative monadic secondorder logic
 In Proceedings of LICS’13
, 2013
"... Abstract—While monadic secondorder logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count. An automata model capable of computing such properties are weighted automata, but logics equivalent to these automata have o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—While monadic secondorder logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count. An automata model capable of computing such properties are weighted automata, but logics equivalent to these automata have
PrefixRecognisable Graphs and Monadic SecondOrder Logic
, 2001
"... We present several characterisations of the class of prefixrecognisable ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We present several characterisations of the class of prefixrecognisable
The click modular router
, 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract

Cited by 1155 (28 self)
 Add to MetaCart
devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Configurations are written in a declarative language that supports userdefined abstractions. This language is both readable by humans and easily manipulated by tools. We present
Results 1  10
of
118,640