3678 search results - page 20 / 736 » On the Stable Paths Problem |
ALGORITHMICA
2010
13 years 10 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
IWANN
1997
Springer
14 years 2 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
WG
2005
Springer
14 years 3 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
ALGORITHMICA
2010
13 years 10 months ago
2010
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
AICCSA
2006
IEEE
14 years 3 months ago
2006
IEEE
Software analysis patterns are believed to play a major role in reducing the cost and condensing the time of software product lifecycles. However, analysis patterns have not reali...