Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing.

Abstract

Available from STL, Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi

    Similar works