scientific article
From MaRDI portal
Publication:3474496
zbMath0696.90077MaRDI QIDQ3474496
Arthur L. Liestman, Siu-Cheung Chau
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Communication theory (94A05)
Related Items (20)
Bounded-call broadcasting ⋮ Minimum \(k\)-broadcast graphs ⋮ A minimum broadcast graph on 63 vertices ⋮ A new construction of broadcast graphs ⋮ Time-relaxed broadcasting in communication networks ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ More broadcast graphs ⋮ Diametral broadcast graphs ⋮ Sparse broadcast graphs ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Minimum broadcast digraphs ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ A New Construction of Broadcast Graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ The even adjacency split problem for graphs ⋮ Compound constructions of broadcast networks ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ On the construction of regular minimal broadcast digraphs ⋮ Graph theoretical issues in computer networks
This page was built for publication:
