34 search results - page 7 / 7 » The firefighter problem for cubic graphs |
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
APPML
2007
13 years 5 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
VMV
2003
13 years 6 months ago
2003
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
INFOCOM
2008
IEEE
13 years 12 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...