A graph-theoretic decomposition technique for fixed channel assignment problems in cellular radio networks

In order to reduce the dimensionality and computational complexity of intractable fixed channel assignment (FCA) problems, a decomposition technique is presented. The decomposition of FCA problem is developed in terms of a directed graph-partitioning problem, and an efficient algorithm is applied to obtain an optimal partition. The solution of the proposed algorithm is aimed at generating a set of small-size, weakly-interconnected and easily tractable FCA subproblems. Depending on structure of multicut of the partition obtained, the FCA subproblems so developed then can be solved in parallel or sequentially by tailoring any known deterministic or approximate solution technique. The computational results obtained show that the algorithm can be used for a wide range of graph topologies. The application of the solution obtained from the use of the algorithm is reported elsewhere.