335 search results - page 15 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
CONCUR
2003
Springer
14 years 19 days ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...