3471 search results - page 330 / 695 » Obstacle Numbers of Graphs |
203
click to vote
TCS
2010
15 years 5 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
140
click to vote
BIRTHDAY
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
164
click to vote
CPM
2004
Springer
16 years 20 days ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
207
click to vote
EUROPAR
2004
Springer
16 years 20 days ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
226
click to vote
IPTPS
2003
Springer
16 years 14 days ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...