Dynamic detection of subgraphs in computer networks (Q1263956)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic detection of subgraphs in computer networks |
scientific article; zbMATH DE number 4128355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic detection of subgraphs in computer networks |
scientific article; zbMATH DE number 4128355 |
Statements
Dynamic detection of subgraphs in computer networks (English)
0 references
1990
0 references
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.
0 references
computer networks
0 references
tree detection
0 references
routing
0 references
distributed algorithm
0 references
changing topology
0 references
