1172 search results - page 41 / 235 » Path Algorithms on Regular Graphs |
ISCI
2008
13 years 9 months ago
2008
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
ML
2010
ACM
13 years 4 months ago
2010
ACM
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— We continue our investigation into the application of pervasive, embedded networks to support multi-robot tasks. In this work we use a new a hardware platform, the GNATs, to ai...
JDA
2006
13 years 10 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...