Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A distributed algorithm for constructing a minimum diameter spanning tree
Journal of Parallel and Distributed Computing
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Hi-index | 0.00 |