#### Filter Results:

#### Publication Year

2010

2014

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

Wireless networks are often modelled as different grids and the channel assignment problem for interference avoidance is formulated as a coloring problem of the grid graph, where channels (i.e., colors) assigned to interfering stations (i.e., vertices) at distance i must be at least δi apart, while the same channel can be reused in vertices whose… (More)

Cellular networks are often modelled as different regular grids and the channel assignment problem for interference avoidance is formulated as a coloring problem of the grid graph, where channels assigned to interfering stations at distance i must be at least δ i apart, while the same channel can be reused in vertices whose distance is at least… (More)

Wireless cellular networks are often modelled as different regular grids and the channel assignment problem for interference avoidance is formulated as a coloring problem of the grid graph, where channels assigned to interfering stations at distance i must be at least δ<inf>i</inf> apart, while the same channel can be reused in stations whose… (More)

- ‹
- 1
- ›