2796 search results - page 15 / 560 » The coolest path problem |
COLOGNETWENTE
2009
14 years 9 months ago
2009
ENDM
2010
14 years 9 months ago
2010
SOFSEM
2004
Springer
15 years 5 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
107
click to vote
TC
1998
14 years 11 months ago
1998
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
120
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...