1594 search results - page 19 / 319 » An Algorithm to Compute Collusion Paths |
83
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
APNOMS
2007
Springer
15 years 5 months ago
2007
Springer
The multi-homing technology can provide an extended coverage area via distinct access technologies. Also, it is able to redirect a flow from one interface to another without reinit...
103
Voted
TAMC
2009
Springer
15 years 6 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...