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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1996.2618 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971853029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for gossiping by mail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Separators of Planar and Outerplanar Graphs With Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telegraphs / rank
 
Normal rank
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: Optimal algorithms for dissemination of information in some interconnection networks / 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: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in butterfly and deBruijn networks / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:53, 27 May 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for broadcast and gossip in the edge-disjoint modes
scientific article

    Statements