Index Terms
- About the redesign
The path to the new XRDS
Recommendations
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02: Revised Papers from the 4th International Workshop on Algorithm Engineering and ExperimentsWe evaluate the practical efficiency of a new shortest path algorithm for undirected graphs which was developed by the first two authors. This algorithm works on the fundamental comparison-addition model.Theoretically, this new algorithm out-performs ...
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
LCN '99: Proceedings of the 24th Annual IEEE Conference on Local Computer NetworksThis paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the bandwidth to be shared by multiple receivers and simultaneously guarantee ...
A label-setting algorithm for finding a quickest path
The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...
Comments