Collision-free path coloring with application to minimum-delay gathering in sensor networks (Q1026148): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009769295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Algorithms on Paths Under Interference Constraints / 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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate balanced data gathering in energy-constrained sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster broadcasting in unknown radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time data gathering in sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks / rank
 
Normal rank

Latest revision as of 17:34, 1 July 2024

scientific article
Language Label Description Also known as
English
Collision-free path coloring with application to minimum-delay gathering in sensor networks
scientific article

    Statements