The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimum-time line broadcast networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal algorithms for dissemination of information in generalized communication modes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New gossips and telephones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002466 / rank | |||
Normal rank |
Latest revision as of 21:46, 29 July 2024
scientific article; zbMATH DE number 7573210
Language | Label | Description | Also known as |
---|---|---|---|
English | The relationship between gossiping in vertex-disjoint paths mode and bisection width |
scientific article; zbMATH DE number 7573210 |
Statements
The relationship between gossiping in vertex-disjoint paths mode and bisection width (English)
0 references
18 August 2022
0 references