Graph theoretical issues in computer networks
From MaRDI portal
Publication:1319540
DOI10.1016/0377-2217(93)90256-MzbMath0801.68011WikidataQ57387896 ScholiaQ57387896MaRDI QIDQ1319540
Giorgio Gambosi, Jacek Błażewicz, Jerzy Brzeziński
Publication date: 12 April 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel algorithms for gossiping by mail
- Finding small simple cycle separators for 2-connected planar graphs
- On fault tolerant routings in general networks
- Efficient fault-tolerant routings in networks
- A new look at fault-tolerant network routing
- Designing networks with compact routing tables
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Fault-tolerant routings in a \(\kappa\)-connected network
- Further gossip problems
- Sparse broadcast graphs
- Spreading information by conferences
- Minimum broadcast graphs
- Gossips and telegraphs
- On Gossiping with Faulty Telephone Lines
- Improved routing strategies with succinct tables
- Labelling and Implicit Routing in Networks
- Space-Efficient Message Routing inc-Decomposable Networks
- Telephone Problems with Failures
- Fault-tolerant broadcast graphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Complexity of network synchronization
- A new distributed algorithm to find breadth first search trees
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A survey of gossiping and broadcasting in communication networks
- Interval Routing
- Broadcast Networks of Bounded Degree
- Parallel Symmetry-Breaking in Sparse Graphs
- Graph spanners
- On the construction of minimal broadcast networks
- Efficient Message Routing in Planar Networks
- Minimal broadcast networks
- A Separator Theorem for Planar Graphs
- Information Dissemination in Trees
- A Problem with Telephones
- Broadcasting in Bounded Degree Graphs
- Gossiping in Minimal Time
- Locality in Distributed Graph Algorithms
- Fast Gossiping for the Hypercube
- Routing with Polynomial Communication-Space Trade-Off
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- A trade-off between space and efficiency for routing tables
- Time bounds on fault‐tolerant broadcasting
- Generating sparse spanners for weighted graphs
- Low-diameter graph decomposition is in NC
- Tight Bounds on Mimimum Broadcast Networks
- Fast network decomposition
