Pages that link to "Item:Q3608876"
From MaRDI portal
The following pages link to A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs (Q3608876):
Displaying 12 items.
- Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs (Q496697) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- On modeling and analysis of MIMO wireless mesh networks with triangular overlay topology (Q1664902) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258) (← links)
- Multicoloring of cannonball graphs (Q2810379) (← links)
- \(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs (Q2883583) (← links)
- 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs (Q3005572) (← links)
- Absolute and asymptotic bounds for online frequency allocation in cellular networks (Q5961981) (← links)