1493 search results - page 10 / 299 » Local resilience of graphs |
261
Voted
JNW
2008
15 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 ...
184
Voted
CIE
2008
Springer
15 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...
304
click to vote
IJCAI
1993
15 years 8 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...
179
Voted
FUIN
2006
15 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...
117
Voted
ICRA
1998
IEEE
15 years 11 months ago
1998
IEEE