13 search results - page 1 / 3 » Monotonicity of Non-deterministic Graph Searching |
OPODIS
2007
13 years 6 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
WG
2007
Springer
13 years 11 months ago
2007
Springer
ICAPR
2009
Springer
13 years 10 months ago
2009
Springer
—This paper presents a novel biometric sensor generated evidence fusion of face and palmprint images using wavelet decomposition for personnel identity verification. The approach...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...