Easy problems for tree-decomposable graphs
Journal of Algorithms
Arboricity and bipartite subgraph listing algorithms
Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Recognizability, hypergraph operations, and logical types
Information and Computation
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Theory of Computing Systems
| Hi-index | 0.00 |
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of such classes can be covered by graphs of bounded clique-width with limited overlaps. We also consider such labelings for bounded first-order formulas on graph classes of bounded expansion. Some of these results are extended to counting queries.