Inductive computations on graphs defined by clique-width expressions

Carrère, Frédérique

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 3, pp. 625-651.

Résumé

Labelling problems for graphs consist in building distributed data structures, making it possible to check a given graph property or to compute a given function, the arguments of which are vertices. For an inductively computable function $D$, if $G$ is a graph with $n$ vertices and of clique-width at most $k$, where $k$ is fixed, we can associate with each vertex $x$ of $G$ a piece of information (bit sequence) $\mathrm{lab}\left(x\right)$ of length $O\left({log}^2\left(n\right)\right)$ such that we can compute $D$ in constant time, using only the labels of its arguments. The preprocessing can be done in time $O(h.n)$ where $h$ is the height of the syntactic tree of $G$. We perform an inductive computation, without using the tools of monadic second order logic. This enables us to give an explicit labelling scheme and to avoid constants of exponential size.

Détail

DOI : 10.1051/ita/2009010

Classification : 68R10, 90C35
Mots-clés : terms, graphs, clique-width, labeling schemes, inductive computation