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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58218-5_20
+Normal rank
@@ Property / OpenAlex ID @@
+W1567696985
@@ Property / OpenAlex ID: W1567696985 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Separators of Planar and Outerplanar Graphs With Applications
+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 @@
+Q3359735
@@ Property / cites work: Q3359735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4870160
@@ Property / cites work: Q4870160 / rank @@
+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