2796 search results - page 3 / 560 » The coolest path problem |
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
TON
2002
13 years 10 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
TAMC
2009
Springer
14 years 5 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
102
click to vote
Publication
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
DAM
1999
13 years 10 months ago
1999
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...