Pages that link to "Item:Q5390012"
From MaRDI portal
The following pages link to Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time (Q5390012):
Displaying 9 items.
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Distributed \((\varDelta + 1)\)-coloring in the physical model (Q742411) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces (Q3677786) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465876) (← links)
- (Q5743464) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
