Graph theoretical issues in computer networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432834 (Why is no real title available?)
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- scientific article; zbMATH DE number 4141826 (Why is no real title available?)
- scientific article; zbMATH DE number 3940741 (Why is no real title available?)
- scientific article; zbMATH DE number 4102999 (Why is no real title available?)
- scientific article; zbMATH DE number 3692664 (Why is no real title available?)
- scientific article; zbMATH DE number 3702701 (Why is no real title available?)
- scientific article; zbMATH DE number 177560 (Why is no real title available?)
- scientific article; zbMATH DE number 177869 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A Problem with Telephones
- A Separator Theorem for Planar Graphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A new distributed algorithm to find breadth first search trees
- A new look at fault-tolerant network routing
- A survey of gossiping and broadcasting in communication networks
- A trade-off between space and efficiency for routing tables
- Broadcast Networks of Bounded Degree
- Broadcasting in Bounded Degree Graphs
- Complexity of network synchronization
- Designing networks with compact routing tables
- Efficient Message Routing in Planar Networks
- Efficient fault-tolerant routings in networks
- Fast Gossiping for the Hypercube
- Fast network decomposition
- Fault-tolerant broadcast graphs
- Fault-tolerant routings in a \(\kappa\)-connected network
- Finding small simple cycle separators for 2-connected planar graphs
- Further gossip problems
- Generating sparse spanners for weighted graphs
- Gossiping in Minimal Time
- Gossips and telegraphs
- Graph spanners
- Improved routing strategies with succinct tables
- Information Dissemination in Trees
- Interval Routing
- Labelling and Implicit Routing in Networks
- Locality in Distributed Graph Algorithms
- Low-diameter graph decomposition is in NC
- Minimal broadcast networks
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- Minimum broadcast graphs
- On Gossiping with Faulty Telephone Lines
- On fault tolerant routings in general networks
- On the construction of minimal broadcast networks
- Parallel Symmetry-Breaking in Sparse Graphs
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Parallel algorithms for gossiping by mail
- Routing with Polynomial Communication-Space Trade-Off
- Space-Efficient Message Routing inc-Decomposable Networks
- Sparse broadcast graphs
- Spreading information by conferences
- Telephone Problems with Failures
- Tight Bounds on Mimimum Broadcast Networks
- Time bounds on fault‐tolerant broadcasting
Cited in
(4)
This page was built for publication: Graph theoretical issues in computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319540)
