On the public citation graph

Minimum‐time line broadcast networks

0 signed · 76 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.3230090404openalex-snapshot
Minimal broadcast networks
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1109/tc.1981.1675796openalex-snapshot
Minimum Broadcast Trees

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<40::aid-net4>3.0.co;2-zopenalex-snapshot
Source-limited inclusive routing: A new paradigm for multicast communication
inferred← citeshttps://doi.org/10.1002/net.10030openalex-snapshot
Length‐constrained path‐matchings in graphs
inferred← citeshttps://doi.org/10.1002/net.10104openalex-snapshot
Minimal path broadcast networks
inferred← citeshttps://doi.org/10.1002/net.1036openalex-snapshot
Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
inferred← citeshttps://doi.org/10.1002/net.20055openalex-snapshot
All-port line broadcasting in highly connected graphs
inferred← citeshttps://doi.org/10.1002/net.21666openalex-snapshot
Line-broadcasting in complete k -ary trees
inferred← citeshttps://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferred← citeshttps://doi.org/10.1002/net.3230190706openalex-snapshot
Time bounds on fault‐tolerant broadcasting
inferred← citeshttps://doi.org/10.1002/net.3230230109openalex-snapshot
Local broadcasting in a tree under minisum criterion
inferred← citeshttps://doi.org/10.1002/net.v45:2openalex-snapshot
inferred← citeshttps://doi.org/10.1006/inco.1996.2618openalex-snapshot
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes
inferred← citeshttps://doi.org/10.1006/jpdc.2002.1848openalex-snapshot
Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching
inferred← citeshttps://doi.org/10.1007/10692760_4openalex-snapshot
Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_37openalex-snapshot
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_84openalex-snapshot
Optimal algorithms for dissemination of information in generalized communication modes
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_56openalex-snapshot
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_258openalex-snapshot
Optimal group gossiping in hypercubes under wormhole routing model
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_60openalex-snapshot
Gossiping in vertex-disjoint paths mode in interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_20openalex-snapshot
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_94openalex-snapshot
The relationship between gossiping in vertex-disjoint paths mode and bisection width
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_79openalex-snapshot
Toward a general theory of unicast-based multicast communication
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_160openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_43openalex-snapshot
Gossip in trees under line-communication mode
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_5openalex-snapshot
Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)
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-540-24698-5_61openalex-snapshot
Bisecting and Gossiping in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/bfb0035167openalex-snapshot
Approximation algorithms for minimum time broadcast
inferred← citeshttps://doi.org/10.1007/s00224-002-1047-5openalex-snapshot
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
inferred← citeshttps://doi.org/10.1007/s00453-013-9810-3openalex-snapshot
Random Walks, Bisections and Gossiping in Circulant Graphs
inferred← citeshttps://doi.org/10.1016/0045-7906(83)90003-4openalex-snapshot
Distributed packet switching queueing network design
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90179-1openalex-snapshot
Optimal algorithms for dissemination of information in generalized communication modes
inferred← citeshttps://doi.org/10.1016/b978-0-08-031132-6.50005-2openalex-snapshot
DISTRIBUTED PACKET SWITCHING QUEUEING NETWORK DESIGN
inferred← citeshttps://doi.org/10.1016/j.dam.2003.11.009openalex-snapshot
A note on line broadcast in digraphs under the edge-disjoint paths mode
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.105openalex-snapshot
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114508openalex-snapshot
Parameterized complexity of broadcasting in graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00277-8openalex-snapshot
Efficient line broadcasting in a d-dimensional grid
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00244-5openalex-snapshot
Sparse Hypercube—a minimal k-line broadcast graph
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00054-1openalex-snapshot
Broadcast and gossip in line-communication mode
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00097-8openalex-snapshot
Minimum-cost line broadcast in paths
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00111-xopenalex-snapshot
Line broadcasting in cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00112-1openalex-snapshot
The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00075-3openalex-snapshot
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00213-9openalex-snapshot
Gossiping in chordal rings under the line model
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00214-0openalex-snapshot
Communication in the two-way listen-in vertex-disjoint paths mode
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00018-8openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1023/b:supe.0000014803.83151.dcopenalex-snapshot
Efficient Collective Communications in Dual-Cube
inferred← citeshttps://doi.org/10.1051/ro:2001104openalex-snapshot
Multiple Routing Strategies in a Labelled Network
inferred← citeshttps://doi.org/10.1090/dimacs/053/02openalex-snapshot
Minimal contention-free matrices with application to multicasting
inferred← citeshttps://doi.org/10.1109/12.93751openalex-snapshot
Information dissemination in trees with nonuniform edge transmission times
inferred← citeshttps://doi.org/10.1109/71.706050openalex-snapshot
Optimized broadcasting and multicasting protocols in cut-through routed networks
inferred← citeshttps://doi.org/10.1109/cit.2010.64openalex-snapshot
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation
inferred← citeshttps://doi.org/10.1109/cw.2002.1180864openalex-snapshot
From dual-cube to metacube: efficient low-degree alternatives to hypercube
inferred← citeshttps://doi.org/10.1109/hicss.1995.375498openalex-snapshot
Structured communication in torus networks
inferred← citeshttps://doi.org/10.1109/icpp.1997.622671openalex-snapshot
Sufficient conditions for optimal multicast communication
inferred← citeshttps://doi.org/10.1109/icpp.2000.876065openalex-snapshot
A problem-specific fault-tolerance mechanism for asynchronous, distributed systems
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846005openalex-snapshot
Optimal broadcasting in all-port meshes of trees with distance-insensitive routing
inferred← citeshttps://doi.org/10.1109/ipps.1997.580989openalex-snapshot
Broadcasting and multicasting in cut-through routed networks
inferred← citeshttps://doi.org/10.1109/ipps.1999.760494openalex-snapshot
Sparse hypercube-a minimal k-line broadcast graph
inferred← citeshttps://doi.org/10.1109/iscas.1988.14896openalex-snapshot
Near-optimal broadcasting figures in computer networks
inferred← citeshttps://doi.org/10.1109/iscas.1988.14898openalex-snapshot
Message broadcast in point-to-point computer networks
inferred← citeshttps://doi.org/10.1109/ispan.1999.778910openalex-snapshot
Message scheduling on trees under a generalized line-communication model
inferred← citeshttps://doi.org/10.1109/pccc.1988.10092openalex-snapshot
A distributed broadcast algorithm for binary De Bruijn networks
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365693openalex-snapshot
Rapid rumor ramification: approximating the minimum broadcast time
inferred← citeshttps://doi.org/10.1109/tc.1984.1676496openalex-snapshot
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
inferred← citeshttps://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferred← citeshttps://doi.org/10.1137/s0097539793252870openalex-snapshot
Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
inferred← citeshttps://doi.org/10.1137/s0895480101386620openalex-snapshot
Minimal-Time k -Line Broadcasting
inferred← citeshttps://doi.org/10.1137/s0895480193245923openalex-snapshot
Approximation Algorithms for Minimum-Time Broadcast
inferred← citeshttps://doi.org/10.1142/s0129626405002106openalex-snapshot
STATION PLACEMENT IN NETWORKS
inferred← citeshttps://doi.org/10.1145/258492.258510openalex-snapshot
Approximation algorithms for structured communication problems
inferred← citeshttps://doi.org/10.33915/etd.3172openalex-snapshot
Broadcasting in grid graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02491openalex-snapshot
Line-Broadcasting in Complete k-Trees
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94035openalex-snapshot
Anells cordals:propietats estructurals i models de comunicacions
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.