3211 search results - page 238 / 643 » On the Grundy Number of a Graph |
175
click to vote
SSS
2010
Springer
15 years 5 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...
197
click to vote
KR
2004
Springer
15 years 12 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...
139
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...
195
click to vote
SIROCCO
2007
15 years 8 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
159
click to vote
TAP
2008
Springer
15 years 6 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...