707 search results - page 10 / 142 » Solving path problems on the GPU |
COCO
2000
Springer
15 years 1 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
ENDM
2010
14 years 7 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
89
Voted
MCU
2004
14 years 11 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
CATA
2004
14 years 11 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...