On the public citation graph
Tight Bounds on Mimimum Broadcast Networks
0 signed · 89 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230100106openalex-snapshot
Minimum‐time line broadcast networks
inferredcites →https://doi.org/10.1002/net.3230150203openalex-snapshot
Fault‐tolerant broadcast graphs
inferredcites →https://doi.org/10.1002/net.3230180205openalex-snapshot
Generalizations of broadcasting and gossiping
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90153-4openalex-snapshot
A class of solutions to the gossip problem, part I
inferredcites →https://doi.org/10.1016/0166-218x(88)90047-9openalex-snapshot
Broadcasting in one dimension
inferredcites →https://doi.org/10.1109/tc.1984.1676496openalex-snapshot
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
inferredcites →https://doi.org/10.1109/tcom.1976.1093384openalex-snapshot
Routing in Packet-Switching Broadcast Radio Networks
inferredcites →https://doi.org/10.1137/0602040openalex-snapshot
Broadcasting in Trees with Multiple Originators
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6openalex-snapshot
Improved upper and lower bounds fork-broadcasting
inferred← citeshttps://doi.org/10.1002/net.1019openalex-snapshot
An algorithm for constructing minimal c‐broadcast networks
inferred← citeshttps://doi.org/10.1002/net.20270openalex-snapshot
A linear algorithm for finding the k‐broadcast center of a tree
inferred← citeshttps://doi.org/10.1002/net.21749openalex-snapshot
New upper bound on m‐time‐relaxed k‐broadcast graphs
inferred← citeshttps://doi.org/10.1002/net.3230220505openalex-snapshot
Tighter time bounds on fault‐tolerant broadcasting and gossiping
inferred← citeshttps://doi.org/10.1002/net.3230260409openalex-snapshot
Multiple message broadcasting in communication networks
inferred← citeshttps://doi.org/10.1006/jagm.2001.1204openalex-snapshot
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_19openalex-snapshot
The minimum broadcast time problem
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_20openalex-snapshot
A Simple Construction of Broadcast Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-93176-6_6openalex-snapshot
The Complexity of Finding a Broadcast Center
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_24openalex-snapshot
Parameterized Complexity of Broadcasting in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_29openalex-snapshot
Broadcast Graph is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_17openalex-snapshot
A New Construction of Broadcast Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_18openalex-snapshot
Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_45openalex-snapshot
Plane Gossip: Approximating Rumor Spread in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_18openalex-snapshot
Improved Lower Bound on Broadcast Function Based on Graph Partition
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_3openalex-snapshot
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_11openalex-snapshot
Efficient Information Exchange in the Random Phone-Call Model
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_48openalex-snapshot
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_12openalex-snapshot
Source-Oblivious Broadcast
inferred← citeshttps://doi.org/10.1007/bf02110308openalex-snapshot
A doubling procedure for constructing minimal broadcast networks
inferred← citeshttps://doi.org/10.1007/bfb0030869openalex-snapshot
Broadcasting in general networks I: Trees
inferred← citeshttps://doi.org/10.1007/s00453-007-9113-7openalex-snapshot
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90141-vopenalex-snapshot
Broadcasting and spanning trees in de Bruijn and Kautz networks
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90147-3openalex-snapshot
Broadcasting in DMA-bound bounded degree graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90148-4openalex-snapshot
Minimum broadcast digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90178-3openalex-snapshot
Bounded-call broadcasting
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90185-6openalex-snapshot
Minimum k-broadcast graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90190-2openalex-snapshot
Some minimum broadcast graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00230-gopenalex-snapshot
The minimum broadcast time problem for several processor networks
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90256-mopenalex-snapshot
Graph theoretical issues in computer networks
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.013openalex-snapshot
Broadcasting from multiple originators
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.002openalex-snapshot
On time-relaxed broadcasting networks
inferred← citeshttps://doi.org/10.1016/j.dam.2014.01.025openalex-snapshot
Efficient construction of broadcast graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.008openalex-snapshot
Binary linear programming models for robust broadcasting in communication networks
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.029openalex-snapshot
Efficient broadcast trees for weighted vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2018.09.015openalex-snapshot
A new construction of broadcast graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.03.002openalex-snapshot
Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.013openalex-snapshot
Bounds on broadcast time in well-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.016openalex-snapshot
Upper bounds on the broadcast function using minimum dominating sets
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.03.001openalex-snapshot
Gossip Latin square and the meet-all gossipers problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114508openalex-snapshot
Parameterized complexity of broadcasting in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00495-8openalex-snapshot
On the monotonicity of the broadcast function
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00179-3openalex-snapshot
Hierarchical broadcast networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00114-5openalex-snapshot
Time-relaxed broadcasting in communication networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00043-8openalex-snapshot
Compound constructions of broadcast networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00183-3openalex-snapshot
The even adjacency split problem for graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00282-0openalex-snapshot
On the structure of minimum broadcast digraphs
inferred← citeshttps://doi.org/10.1016/s0893-9659(04)90059-6openalex-snapshot
A 1-relaxed minimum broadcast graph on 15 vertices
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00405-6openalex-snapshot
Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
inferred← citeshttps://doi.org/10.1023/a:1025838126048openalex-snapshot
Construction of Time-Relaxed c-Broadcast Networks
inferred← citeshttps://doi.org/10.1109/icpads.1996.517555openalex-snapshot
Some sparse time-relaxed broadcast communication networks
inferred← citeshttps://doi.org/10.1109/icpwc.1999.759577openalex-snapshot
Broadcasting in large unicyclic communication networks
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846024openalex-snapshot
Reduction optimization in heterogeneous cluster environments
inferred← citeshttps://doi.org/10.1109/iv.2007.84openalex-snapshot
New Construction of Broardcast Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365693openalex-snapshot
Rapid rumor ramification: approximating the minimum broadcast time
inferred← citeshttps://doi.org/10.1137/0405002openalex-snapshot
Broadcasting in Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1137/0405015openalex-snapshot
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
inferred← citeshttps://doi.org/10.1137/s0097539795283619openalex-snapshot
Fast Gossiping by Short Messages
inferred← citeshttps://doi.org/10.1137/s0097539798347906openalex-snapshot
Message Multicasting in Heterogeneous Networks
inferred← citeshttps://doi.org/10.1137/s0895480295292934openalex-snapshot
Time and Cost Trade-Offs in Gossiping
inferred← citeshttps://doi.org/10.1142/s0129626499000086openalex-snapshot
CONSTRUCTION OF TIME-RELAXED MINIMAL BROADCAST NETWORKS
inferred← citeshttps://doi.org/10.1145/276698.276857openalex-snapshot
Multicasting in heterogeneous networks
inferred← citeshttps://doi.org/10.1145/341800.341816openalex-snapshot
Broadcast scheduling optimization for heterogeneous cluster systems
inferred← citeshttps://doi.org/10.12681/eadd/7129openalex-snapshot
COLLECTIVE COMMUNICATION PROBLEMS IN MULTIPROCESSORS
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.