Efficient First-Order Model-Checking Using Short Labels

Bruno Courcelle (1, 2) , Cyril Gavoille (1) , Mamadou Moustapha Kanté (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 IUF - Institut universitaire de France

We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, which contains in particular, the nicely locally tree-decomposable classes. For every class of graphs of bounded expansion we prove that every bounded formula has an O(log(n))-labeling scheme. We also prove that every quantifier-free formula has an O(log(n))-labeling scheme in graphs of bounded ar

Mots clés: Labeling Scheme; Local Bounded Clique-Width; First-Order Logic; Bounded Formula; Locally Cwd-Decomposable

Domaines: Mathématique discrète [cs.DM]

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté. Efficient First-Order Model-Checking Using Short Labels. Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, Jun 2008, Changsha, China. pp.159-170, ⟨10.1007/978-3-540-69311-6_18⟩. ⟨hal-00333894⟩