193 search results - page 15 / 39 » A Lower Bound for the Shortest Path Problem |
123
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
111
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
100
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
CSFW
2009
IEEE
15 years 6 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...