Tree decomposition algorithm for large networks
W. J. Blewett, T. C. Hu · Networks · 1977
Abstract Decomposition algorithms have been proposed for finding the shortest paths between all pairs of nodes in a large network. The central idea is to treat the large network as several small networks overlapping each other. When the small networks overlap each other linearly, algorithms have been proposed to treat each small network individually. The present note treats the case of small networks overlapping each other like a tree.