268 search results - page 21 / 54 » Finding the k Shortest Paths |
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
TCS
2008
13 years 7 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Quick and efficient response to emergency is important for every city. This depends on the quality of the dispatch of emergency service to the scene and back to hospital or other ...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...