Sciweavers

3678 search results - page 174 / 736
» On the Stable Paths Problem
Sort
View
BMVC
2010
15 years 1 months ago
Detection of Curves with Unknown Endpoints using Minimal Path Techniques
We present a novel method to detect curves with unknown endpoints using minimal path techniques. Our work builds on the state of the art minimal path techniques currently used to ...
Vivek Kaul, Yichang Tsai, Anthony J. Yezzi
DAM
2011
14 years 10 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
NFM
2011
335views Formal Methods» more  NFM 2011»
14 years 10 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
137
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 10 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
DGCI
2009
Springer
15 years 7 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...