FAW
2008
Springer
13 years 6 months ago
2008
Springer
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, whic...