On the public citation graph

Neighbourhood information dissemination in the star graph

0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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.3230230403openalex-snapshot
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
inferredcites →https://doi.org/10.1006/jpdc.1995.1006openalex-snapshot
Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions
inferredcites →https://doi.org/10.1016/0016-0032(79)90004-8openalex-snapshot
Gossips and telegraphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90086-oopenalex-snapshot
A broadcasting algorithm in star graph interconnection networks
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/0167-8191(93)90107-vopenalex-snapshot
A novel routing scheme on the star and pancake networks and its applications
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.247843openalex-snapshot
A routing and broadcasting scheme on faulty star graphs
inferredcites →https://doi.org/10.1109/12.277296openalex-snapshot
The cost of broadcasting on star graphs and k-ary hypercubes
inferredcites →https://doi.org/10.1109/12.485370openalex-snapshot
Edge-disjoint spanning trees on the star network with applications to fault tolerance
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.388046openalex-snapshot
An optimal broadcasting algorithm without message redundancy in star graphs
inferredcites →https://doi.org/10.1109/71.553290openalex-snapshot
Optimal information dissemination in star and pancake networks
inferredcites →https://doi.org/10.1137/0221010openalex-snapshot
Gossiping in Minimal Time
inferredcites →https://doi.org/10.1137/0221026openalex-snapshot
Fast Gossiping for the Hypercube
inferredcites →https://doi.org/10.1142/s0129626498000201openalex-snapshot
Neighbourhood Gossiping in Hypercubes
inferredcites →https://doi.org/10.1145/72935.72969openalex-snapshot
On the number of rounds necessary to disseminate information

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_9openalex-snapshot
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_39openalex-snapshot
Mathematical Performance Modelling of Stretched Hypercubes
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00371-3openalex-snapshot
Neighborhood Communications in Networks
inferred← citeshttps://doi.org/10.1093/ietisy/e88-d.1.89openalex-snapshot
Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370904openalex-snapshot
Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183375openalex-snapshot
A novel neighbourhood broadcasting algorithm on star graphs
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040908openalex-snapshot
Worst case analysis of a greedy multicast algorithm in k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924995openalex-snapshot
Log-time multicast to local vertices in the star graph
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370594openalex-snapshot
Performance Modelling of Necklace Hypercubes
inferred← citeshttps://doi.org/10.1137/040617716openalex-snapshot
Neighborhood Broadcasting in Hypercubes
inferred← citeshttps://doi.org/10.1142/s0219265901000336openalex-snapshot
ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265903000751openalex-snapshot
AN OPTIMAL NEIGHBOURHOOD BROADCASTING SCHEME FOR STAR INTERCONNECTION NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265903000957openalex-snapshot
Optimal Neighborhood Broadcast in Star Graphs
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.