On the public citation graph
Sparse Relaxed Broadcast Graphs
0 signed · 27 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/(sici)1097-0037(199607)27:4<293::aid-net4>3.0.co;2-bopenalex-snapshot
Fault-tolerant minimum broadcast networks
inferredcites →https://doi.org/10.1002/net.21749openalex-snapshot
New upper bound on m‐time‐relaxed k‐broadcast graphs
inferredcites →https://doi.org/10.1002/net.3230150203openalex-snapshot
Fault‐tolerant broadcast graphs
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1002/net.3230230505openalex-snapshot
A new method for constructing minimal broadcast networks
inferredcites →https://doi.org/10.1002/rsa.3240010406openalex-snapshot
Randomized broadcast in networks
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_11openalex-snapshot
Efficient Information Exchange in the Random Phone-Call Model
inferredcites →https://doi.org/10.1007/bf02110308openalex-snapshot
A doubling procedure for constructing minimal broadcast networks
inferredcites →https://doi.org/10.1007/s00446-017-0312-4openalex-snapshot
Breaking the $$\log n$$ log n barrier on rumor spreading
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1016/0166-218x(89)90024-3openalex-snapshot
Extremal broadcasting problems
inferredcites →https://doi.org/10.1016/0166-218x(94)00033-6openalex-snapshot
Broadcasting in random graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/j.dam.2014.01.025openalex-snapshot
Efficient construction of broadcast graphs
inferredcites →https://doi.org/10.1016/j.dam.2018.09.015openalex-snapshot
A new construction of broadcast graphs
inferredcites →https://doi.org/10.1016/j.disc.2012.06.016openalex-snapshot
Upper bounds on the broadcast function using minimum dominating sets
inferredcites →https://doi.org/10.1016/s0012-365x(02)00495-8openalex-snapshot
On the monotonicity of the broadcast function
inferredcites →https://doi.org/10.1016/s0166-218x(97)00114-5openalex-snapshot
Time-relaxed broadcasting in communication networks
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/sfcs.1994.365693openalex-snapshot
Rapid rumor ramification: approximating the minimum broadcast time
inferredcites →https://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferredcites →https://doi.org/10.1137/s0895480193245923openalex-snapshot
Approximation Algorithms for Minimum-Time Broadcast
inferredcites →https://doi.org/10.1142/s0129626409000250openalex-snapshot
TIME-RELAXED 1-FAULT TOLERANT BROADCAST NETWORKS
inferredcites →https://doi.org/10.1142/s0129626499000086openalex-snapshot
CONSTRUCTION OF TIME-RELAXED MINIMAL BROADCAST NETWORKS
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.