Improved upper and lower bounds fork-broadcasting

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6" /><94::AID-NET4>3.0.CO;2-6 10.1002/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6zbMath0971.05059OpenAlexW2066613498MaRDI QIDQ2714909

Hovhannes A. Harutyunyan, Arthur L. Liestman

Publication date: 20 June 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6

zbMATH Keywords

broadcastingminimum broadcast graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Binary linear programming models for robust broadcasting in communication networks ⋮ A new construction of broadcast graphs ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ k-Broadcasting in trees ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Broadcasting in weighted trees under the postal model

Cites Work

• Broadcasting in DMA-bound bounded degree graphs
• Minimum \(k\)-broadcast graphs
• On Moore Graphs with Diameters 2 and 3
• Largest Known Twin Primes
• A survey of gossiping and broadcasting in communication networks
• Algebraic Graph Theory
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Improved upper and lower bounds fork-broadcasting