1172 search results - page 17 / 235 » Path Algorithms on Regular Graphs |
116
Voted
CSL
2003
Springer
15 years 5 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
101
Voted
ERSHOV
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
62
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
118
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
92
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...