Algorithms & Theory Thinh Dinh
30 | Efficient Hamiltonian Reduction for Scalable Quantum Computing on Clique Cover/Graph Coloring Problems in SatCom
Clique cover and graph coloring are complementary problems which have many applications in wireless communications, especially in satellite communications (SatCom).