2432 search results - page 399 / 487 » Degrees and choice numbers |
164
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
167
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
153
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
204
click to vote
CSFW
2002
IEEE
15 years 11 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
154
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...