Optimal gathering protocols on paths under interference constraints (Q1045041): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Gathering Algorithms on Paths Under Interference Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gossiping by Short Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Wireless Gathering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast broadcasting and gossiping in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic inapproximability of the radio broadcast problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centralized broadcast in multihop radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally Fast Data Gathering in Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bandwidth allocation in radio networks / rank
 
Normal rank

Latest revision as of 07:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimal gathering protocols on paths under interference constraints
scientific article

    Statements

    Identifiers