207 search results - page 18 / 42 » Powers of cycles, powers of paths, and distance graphs |
105
click to vote
SI3D
2003
ACM
15 years 5 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
COMBINATORICA
2008
14 years 12 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
111
Voted
BMCBI
2010
14 years 12 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
ICNP
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
116
click to vote
ROBOCOMM
2007
IEEE
15 years 6 months ago
2007
IEEE
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...