Pages that link to "Item:Q3922180"

The following pages link to Information Dissemination in Trees (Q3922180):

Displaying 50 items.

• Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
• Broadcasting on cactus graphs (Q512890) (← links)
• Efficient broadcast trees for weighted vertices (Q516786) (← links)
• Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
• The minimum broadcast time problem for several processor networks (Q672455) (← links)
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
• On the number of broadcast schemes in networks (Q845865) (← links)
• On the complexity of the shortest-path broadcast problem (Q896659) (← links)
• Parallel algorithms for gossiping by mail (Q911271) (← links)
• Broadcasting from multiple originators (Q967331) (← links)
• On broadcasting in unicyclic graphs (Q1029711) (← links)
• Extremal broadcasting problems (Q1120554) (← links)
• A class of solutions to the gossip problem. I (Q1170198) (← links)
• Broadcasting and spanning trees in de Bruijn and Kautz networks (Q1199434) (← links)
• Set to set broadcasting in communication networks (Q1208457) (← links)
• Minimum broadcast graphs (Q1256494) (← links)
• Gossips and telegraphs (Q1258315) (← links)
• More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
• Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
• Compound constructions of broadcast networks (Q1296577) (← links)
• The complexity of detecting crossingfree configurations in the plane (Q1317860) (← links)
• Graph theoretical issues in computer networks (Q1319540) (← links)
• Bounded-call broadcasting (Q1339878) (← links)
• Traffic-light scheduling on the grid (Q1339892) (← links)
• Broadcasting on \([0,L]\) (Q1339897) (← links)
• Broadcasting multiple messages in a grid (Q1339899) (← links)
• Minimum-time multidrop broadcast (Q1392528) (← links)
• The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
• Time-relaxed broadcasting in communication networks (Q1392539) (← links)
• The broadcast function value \(B(23)\) is \(33\) or \(34\). (Q1582579) (← links)
• Asymptotically optimal gossiping in radio networks (Q1897368) (← links)
• Bounded depth broadcasting (Q1917294) (← links)
• The broadcast median problem in heterogeneous postal model (Q1956241) (← links)
• The minimum degree group Steiner problem (Q2065790) (← links)
• The complexity of finding a broadcast center (Q2151362) (← links)
• The multiple originator broadcasting problem in graphs (Q2370417) (← links)
• Time efficient centralized gossiping in radio networks (Q2383602) (← links)
• An algorithm for constructing minimal \(c\)-broadcast networks (Q2747800) (← links)
• Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
• Nonadaptive broadcasting in trees (Q3082604) (← links)
• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) (Q3438992) (← links)
• Minimal broadcast networks (Q3861295) (← links)
• Broadcasting in Trees with Multiple Originators (Q3950477) (← links)
• (Q4660727) (← links)
• Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
• A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
• A minimum broadcast graph on 26 vertices (Q5950681) (← links)
• Broadcasting in weighted trees under the postal model (Q5964023) (← links)
• Data transmission in processor networks (Q6084553) (← links)
• Broadcasting in general networks I: Trees (Q6085744) (← links)