Dynamic detection of subgraphs in computer networks
A distributed algorithm for detecting and exploiting tree subgraphs in computer networks is proposed. In a network with fixed topology the algorithm uses a minimal amount of communication. In the case of dynamically changing topology the algorithm makes incremental adaptation only and its communication complexity is linear in the number of topological changes.
scientific article; zbMATH DE number 4128355