Sciweavers

2294 search results - page 35 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
MOBICOM
2012
ACM
13 years 3 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
IPPS
2007
IEEE
15 years 4 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
IJCAI
2007
14 years 11 months ago
A Machine Learning Approach for Statistical Software Testing
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...
Nicolas Baskiotis, Michèle Sebag, Marie-Cla...
CP
2005
Springer
15 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
GD
2006
Springer
15 years 1 months ago
Simultaneous Graph Embedding with Bends and Circular Arcs
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
Justin Cappos, Alejandro Estrella-Balderrama, J. J...