2796 search results - page 19 / 560 » The coolest path problem |
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
71
Voted
CAV
2003
Springer
15 years 5 months ago
2003
Springer
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path that is finite, but not necessarily maximal. Truncated paths arise n...
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
RP
2009
Springer
15 years 6 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
110
click to vote
ICNC
2005
Springer
15 years 5 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...