The following pages link to (Q3145804):
Displaying 16 items.
- Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications (Q816668) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- Minimizing interference in satellite communications using transiently chaotic neural networks (Q971588) (← links)
- Frequency assignment problem in satellite communications using differential evolution (Q991373) (← links)
- Heuristic manipulation, tabu search and frequency assignment (Q1038293) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- Hierarchical cellular network design with channel allocation (Q1887859) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- <i>T</i>-Coloring of product graphs (Q5063281) (← links)
