Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs

Abstract

With the rapid growth in the penetration rate of mobile devices and the surge in demand for mobile data services, small cells and mobile backhaul networks have become the critical focus of next-generation mobile network development. Backhaul requirements within current wireless networks are almost asymmetrical, with most traffic flowing from the core to the handset, but 5G networks will require more symmetrical backhaul capability. The deployment of small cells and the placement of transceivers for cellular phones are crucial in trading off the symmetric backhaul capability and cost-effectiveness. The deployment of small cells is related to the placement of transceivers for cellular phones. Chang, Kloks, and Lee transformed the placement problem into the maximum-clique transversal problem on graphs. From the theoretical point of view, our paper considers the parameterized complexity of variations of the maximum-clique transversal problem for split graphs, doubly chordal graphs, planar graphs, and graphs of bounded treewidth.

Keywords

• parameterized complexity
• asymmetric networks
• signed maximum-clique transversal function
• minus maximum-clique transversal function
• symmetrical backhaul capability