Handbook of theoretical computer science (vol. B)
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Shortest paths in digraphs of small treewidth. Part II: optimal parallel algorithms
ESA '95 Selected papers from the third European symposium on Algorithms
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Graph operations characterizing rank-width
Discrete Applied Mathematics
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
Hi-index | 0.00 |
If P(x1,...,xk) is a graph property expressible in monadic second-order logic, where x1.....,xk denote vertices, if G is a graph with n vertices and of clique-width at most p where p is fixed, then we can associate with each vertex u of G a piece of information I(u) of size O(log(n)) such that, for all vertices x1,...,xk of G, one can decide whether P(x1,....,xk) holds in time O(log(n)) by using only I(x1),....,I(xk). The preprocessing can be done in time O(n log(n)).One can do the same for any fixed monadic second-order optimization function (like distance) by using information of size O(log2(n)) for each vertex and computation time O(log2(n)). In this case preprocessing time is O(-log2(n)).Clique-width is a complexity measure on graphs similar to tree-width, but more powerful since every set of graphs of bounded tree-width has bounded clique-width, but not conversely.Similar results apply to graphs of tree-width at most w and to properties and functions expressed in the version of monadic second-order logic allowing quantifications on sets of edges.