The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for broadcast and gossip in the edge-disjoint modes
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:1392537