33 search results - page 7 / 7 » The upper bound of the number of cycles in a 2-factor of a l... |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
SPAA
2010
ACM
14 years 17 days 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...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...