9532 search results - page 298 / 1907 » Logic, Graphs, and Algorithms |
206
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
176
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
174
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
160
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
165
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...