Pages that link to "Item:Q436862"
From MaRDI portal
The following pages link to Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862):
Displaying 8 items.
- Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
- Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints (Q506696) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- The minimum scheduling time for convergecast in wireless sensor networks (Q1736606) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)