Minimum time broadcast in faulty star networks
From MaRDI portal
Publication:1392530
DOI10.1016/S0166-218X(97)00106-6zbMath0917.90119MaRDI QIDQ1392530
Ugo Vaccaro, Luisa Gargano, Adele A. Rescigno
Publication date: 8 October 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C90: Applications of graph theory
90B18: Communication networks in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
94C15: Applications of graph theory to circuits and networks
Related Items
On fractional dynamic faults with thresholds, Properties of a hierarchical network based on the star graph, Broadcasting in hypercubes and star graphs with dynamic faults., Deterministic Models of Communication Faults
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive broadcasting with faulty nodes
- Decomposing a star graph into disjoint cycles
- A novel routing scheme on the star and pancake networks and its applications
- Unidirectional star graphs
- On the fault-diameter of the star graph
- Fault tolerance of the star graph interconnection network
- Methods and problems of communication in usual networks
- Reliable broadcasting
- Broadcasting on recursively decomposable Cayley graphs
- A note on optimal time broadcast in faulty hypercubes
- Fault tolerant routing in the star and pancake interconnection networks
- Topological properties of star graphs
- On Group Graphs and Their Fault Tolerance
- A survey of gossiping and broadcasting in communication networks
- A group-theoretic model for symmetric interconnection networks
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Time bounds on fault‐tolerant broadcasting
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
- Fault—tolerant hypercube broadcasting via information dispersal
- Approximation algorithms for the k-source multicast tree construction problem
