144 search results - page 11 / 29 » Path extendability of claw-free graphs |
COMPGEOM
1990
ACM
15 years 1 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
101
click to vote
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
BNCOD
2004
14 years 11 months ago
2004
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
ISSRE
2006
IEEE
15 years 3 months ago
2006
IEEE
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...
105
click to vote
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...