37 search results - page 1 / 8 » Distinguishability of Locally Finite Trees |
COMBINATORICS
2007
13 years 11 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
IJCAI
1993
14 years 7 days ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
JCT
2006
13 years 11 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
COMBINATORICA
2004
13 years 10 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
CP
2003
Springer
14 years 4 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...