On the public citation graph
A doubling procedure for constructing minimal broadcast networks
0 signed · 32 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.3230190606openalex-snapshot
On the construction of minimal broadcast networks
inferredcites →https://doi.org/10.1002/net.3230230505openalex-snapshot
A new method for constructing minimal broadcast networks
inferredcites →https://doi.org/10.1007/3-540-54522-0_104openalex-snapshot
Algebraic constructions of efficient broadcast networks
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90148-4openalex-snapshot
Minimum broadcast digraphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90188-0openalex-snapshot
A minimum broadcast graph on 63 vertices
inferredcites →https://doi.org/10.1016/0166-218x(94)90190-2openalex-snapshot
Some minimum broadcast graphs
inferredcites →https://doi.org/10.1137/0139032openalex-snapshot
Broadcast Time in Communication Networks
inferredcites →https://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferredcites →https://doi.org/10.1137/0405002openalex-snapshot
Broadcasting in Bounded Degree Graphs
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(200009)36:2<126::aid-net8>3.0.co;2-3openalex-snapshot
Compounding of gossip graphs
inferred← citeshttps://doi.org/10.1002/net.1019openalex-snapshot
An algorithm for constructing minimal c‐broadcast networks
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-78825-8_18openalex-snapshot
Improved Lower Bound on Broadcast Function Based on Graph Partition
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.013openalex-snapshot
Broadcasting from multiple originators
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.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/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.1142/s0129626409000250openalex-snapshot
TIME-RELAXED 1-FAULT TOLERANT BROADCAST NETWORKS
inferred← citeshttps://doi.org/10.1142/s0129626499000086openalex-snapshot
CONSTRUCTION OF TIME-RELAXED MINIMAL BROADCAST NETWORKS
inferred← citeshttps://doi.org/10.1142/s0217595907001450openalex-snapshot
A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT 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.