On the public citation graph
k‐Broadcasting in trees
0 signed · 28 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/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6openalex-snapshot
Improved upper and lower bounds fork-broadcasting
inferredcites →https://doi.org/10.1002/net.1019openalex-snapshot
An algorithm for constructing minimal c‐broadcast networks
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.1007/978-1-4757-2491-2openalex-snapshot
Combinatorial Network Theory
inferredcites →https://doi.org/10.1016/0166-218x(89)90024-3openalex-snapshot
Extremal broadcasting problems
inferredcites →https://doi.org/10.1016/0166-218x(92)90147-3openalex-snapshot
Broadcasting in DMA-bound bounded degree 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/0166-218x(94)90185-6openalex-snapshot
Minimum k-broadcast graphs
inferredcites →https://doi.org/10.1109/71.406965openalex-snapshot
Computing global combine operations in the multiport postal model
inferredcites →https://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferredcites →https://doi.org/10.1142/s012962649300037xopenalex-snapshot
EFFICIENT GLOBAL COMBINE OPERATIONS IN MULTI-PORT MESSAGE-PASSING SYSTEMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1007/978-3-642-17461-2_24openalex-snapshot
Structured Overlay Network for File Distribution
inferred← citeshttps://doi.org/10.1016/j.dam.2014.03.014openalex-snapshot
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
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.2024.05.035openalex-snapshot
Finding broadcast 2-centers of a tree under the postal model
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.002openalex-snapshot
All-to-all broadcast problems on Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.031openalex-snapshot
Broadcasting in weighted trees under the postal model
inferred← citeshttps://doi.org/10.1023/a:1025838126048openalex-snapshot
Construction of Time-Relaxed c-Broadcast Networks
inferred← citeshttps://doi.org/10.1109/aina.2014.63openalex-snapshot
New Heuristic for Message Broadcasting in Networks
inferred← citeshttps://doi.org/10.1109/icpads.2010.110openalex-snapshot
Broadcasting Algorithm Via Shortest Paths
inferred← citeshttps://doi.org/10.1109/ispan.2000.900296openalex-snapshot
Broadcasting multiple messages in hypercubes
inferred← citeshttps://doi.org/10.1109/pdcat.2009.43openalex-snapshot
Broadcasting Multiple Messages Using Cycle-Rooted Trees
inferred← citeshttps://doi.org/10.1142/s0219265919500063openalex-snapshot
Approximation Algorithm for the Broadcast Time in k-Path Graph
inferred← citeshttps://doi.org/10.1142/s0219265921500377openalex-snapshot
Optimal Broadcasting in Fully Connected Trees
inferred← citeshttps://doi.org/10.59254/sbpo-2020-122565openalex-snapshot
Algoritmo Genético de Chaves Aleatórias Viciadas para o Problema do Tempo de Transmissão Mínimo
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.