Graph theoretical issues in computer networks
type: Item
instance of: scholarly article
title: Graph theoretical issues in computer networks
zbMATH Open document ID: 0801.68011
DOI: 10.1016/0377-2217(93)90256-M
author: Jacek Blazewicz
author: Jerzy Brzeziński
author: Giorgio Gambosi
published in: European Journal of Operational Research
publication date: 1994-04-12T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 550239
zbMATH Keywords: network decomposition
zbMATH Keywords: routing
zbMATH Keywords: gossiping
zbMATH Keywords: broadcasting
zbMATH Keywords: fault-tolerance
zbMATH Keywords: computer networks
MaRDI profile type: Publication
Wikidata QID: Q57387896
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: Generating sparse spanners for weighted graphs
cites work: Complexity of network synchronization
cites work: Fast network decomposition
cites work: Low-diameter graph decomposition is in NC
cites work: Improved routing strategies with succinct tables
cites work: A new distributed algorithm to find breadth first search trees
cites work: Routing with Polynomial Communication-Space Trade-Off
cites work: Parallel algorithms for gossiping by mail
cites work: Q4037431
cites work: Telephone Problems with Failures
cites work: Sparse broadcast graphs
cites work: Broadcasting in Bounded Degree Graphs
cites work: Q3827949
cites work: Efficient fault-tolerant routings in networks
cites work: A Problem with Telephones
cites work: Q3474496
cites work: Q3470486
cites work: Q5834367
cites work: A new look at fault-tolerant network routing
cites work: Gossips and telegraphs
cites work: Minimal broadcast networks
cites work: Minimum broadcast graphs
cites work: Q3886878
cites work: Q4038748
cites work: Designing networks with compact routing tables
cites work: Efficient Message Routing in Planar Networks
cites work: Space-Efficient Message Routing inc-Decomposable Networks
cites work: On the construction of minimal broadcast networks
cites work: Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
cites work: Parallel \((\Delta +1)\)-coloring of constant-degree graphs
cites work: Parallel Symmetry-Breaking in Sparse Graphs
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: Fault-tolerant routings in a \(\kappa\)-connected network
cites work: On Gossiping with Faulty Telephone Lines
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Further gossip problems
cites work: Fast Gossiping for the Hypercube
cites work: Gossiping in Minimal Time
cites work: Fault-tolerant broadcast graphs
cites work: Broadcast Networks of Bounded Degree
cites work: Locality in Distributed Graph Algorithms
cites work: Q3138968
cites work: A Separator Theorem for Planar Graphs
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Finding small simple cycle separators for 2-connected planar graphs
cites work: Q3895500
cites work: Graph spanners
cites work: Time bounds on fault‐tolerant broadcasting
cites work: On fault tolerant routings in general networks
cites work: A trade-off between space and efficiency for routing tables
cites work: Labelling and Implicit Routing in Networks
cites work: Spreading information by conferences
cites work: Information Dissemination in Trees
cites work: Q3711761
cites work: Interval Routing
description: scientific article; zbMATH DE number 550239