1493 search results - page 10 / 299 » Local resilience of graphs |
JNW
2008
13 years 7 months ago
2008
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
IJCAI
1993
13 years 9 months ago
1993
This paper describes a technique whereby an autonomous agent such as a mobile robot can explore an unknown environment and make a topologicalmapofit. It is assumedthat the environ...
FUIN
2006
13 years 7 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
ICRA
1998
IEEE
13 years 12 months ago
1998
IEEE