Dynamic detection of subgraphs in computer networks
type: Item
instance of: scholarly article
title: Dynamic detection of subgraphs in computer networks
zbMATH Open document ID: 0688.68007
DOI: 10.1007/BF01840389
author: Israel Cidon
author: Inder S. Gopal
published in: Algorithmica
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4128355
zbMATH Keywords: computer networks
zbMATH Keywords: tree detection
zbMATH Keywords: routing
zbMATH Keywords: distributed algorithm
zbMATH Keywords: changing topology
reviewed by: Luboš Brim
MaRDI profile type: Publication
cites work: Local Distributed Deadlock Detection by Cycle Detection and Clusterng
cites work: Q5668821
cites work: Q3883524
cites work: A new distributed depth-first-search algorithm
description: scientific article; zbMATH DE number 4128355