Pages that link to "Item:Q2941559"
From MaRDI portal
The following pages link to How Well Can Graphs Represent Wireless Interference? (Q2941559):
Displaying 10 items.
- Connectivity of soft random geometric graphs over annuli (Q281201) (← links)
- Generalized disk graphs (Q832849) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- Mean-Field Limits for Large-Scale Random-Access Networks (Q5084488) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Token traversal in ad hoc wireless networks via implicit carrier sensing (Q5919418) (← links)
- Reception capacity: definitions, game theory and hardness (Q6536157) (← links)