scientific article; zbMATH DE number 4141826
From MaRDI portal
Publication:3474496
zbMATH Open0696.90077MaRDI QIDQ3474496FDOQ3474496
Authors: Siu-Cheung Chau, Arthur L. Liestman 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
- Approximation Algorithms for Minimum-Time Broadcast
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- A new method for constructing minimal broadcast networks
- Broadcasting in split graphs
- On the construction of minimal broadcast networks
- scientific article; zbMATH DE number 3948154
- Set to set broadcasting in communication networks
- A simple construction of broadcast graphs
- scientific article; zbMATH DE number 867692
- A new method for constructing minimal broadcast networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Communication theory (94A05)
Cited In (28)
- Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
- Polynomial-time algorithms for minimum-time broadcast in trees
- A new construction of broadcast graphs
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- A minimum broadcast graph on 63 vertices
- Sparse broadcast graphs
- Broadcasting in DMA-bound bounded degree graphs
- Compound constructions of broadcast networks
- Bounded-call broadcasting
- Minimum \(k\)-broadcast graphs
- Time-relaxed broadcasting in communication networks
- SOFSEM 2006: Theory and Practice of Computer Science
- A 1-relaxed minimum broadcast graph on 15 vertices.
- More broadcast graphs
- Diametral broadcast graphs
- A new construction of broadcast graphs
- On the construction of regular minimal broadcast digraphs
- Graph theoretical issues in computer networks
- Constructing minimum-interference networks
- An algorithm for constructing minimal \(c\)-broadcast networks
- Title not available (Why is that?)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- A new method for constructing minimal broadcast networks
- Minimum broadcast digraphs
- On the construction of minimal broadcast networks
- The even adjacency split problem for graphs
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Minimum broadcast tree decompositions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474496)
