A Tutorial on Clique Problems in Communications and Signal Processing
share
Since its first use by Euler on the seven bridges of Königsberg problem, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. With the shift from analog to digital processing, various design and optimization problems in communications and signal processing systems become discrete in nature. The study of the structure of these discrete programs reveals equivalence with graph theory problems, which makes a large body of the literature readily available for solving and characterizing the complexity of these problems. This tutorial presents a framework for utilizing a particular graph theory problem, known as the clique problem, for solving communications and signal processing problems. In particular, the first part of the tutorial recalls the basic concepts of graph theory, formulates the clique problem and its variants, and suggests optimal and heuristic solutions to solve the problem. Afterwards, the paper provides deterministic and randomized solvers which are particularly interesting for problems in which the construction of the graph is either not feasible or excessively complicated. The tutorial finally presents applications of the clique problem variants to examples in communications and signal processing, mainly the maximum clique problem in machine learning, the maximum weight clique problem in network coding, and the k-clique problem in user-scheduling.
READ FULL TEXT