Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008): Difference between revisions

@@ Property / cites work @@
+Parallel algorithms for gossiping by mail
@@ Property / cites work: Parallel algorithms for gossiping by mail / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Separators of Planar and Outerplanar Graphs With Applications
+Normal rank
@@ Property / cites work @@
+Gossips and telegraphs
@@ Property / cites work: Gossips and telegraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-time line broadcast networks
@@ Property / cites work: Minimum-time line broadcast networks / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for dissemination of information in generalized communication modes
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for dissemination of information in some interconnection networks
+Normal rank
@@ Property / cites work @@
+Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
+Normal rank
@@ Property / cites work @@
+Gossiping in Minimal Time
@@ Property / cites work: Gossiping in Minimal Time / rank @@
+Normal rank
@@ Property / cites work @@
+Broadcasting in butterfly and deBruijn networks
@@ Property / cites work: Broadcasting in butterfly and deBruijn networks / rank @@
+Normal rank
@@ Property / cites work @@
+New gossips and telephones
@@ Property / cites work: New gossips and telephones / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank