3471 search results - page 257 / 695 » Obstacle Numbers of Graphs |
195
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
168
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
154
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
188
Voted
KR
2004
Springer
15 years 11 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
133
click to vote
IS
2008
15 years 6 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...