| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4635874 | Applied Mathematics and Computation | 2006 | 6 Pages |
Abstract
In this paper, we consider a procedure for solving the shortest path problem in the Adleman-Lipton model. The procedure works in O(n) steps for the shortest path problem of an edge-weighted graph with n vertices.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhaocai Wang, Dongmei Xiao, Wenxia Li, Lin He,