A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
One of the graph theoretic approaches of channel assignment for cellular networks is routing a pair of nodes arranged in a single-row axis called single-row routing problem. The network with nodes representing caller and receiver is to be transformed into a single-row network efficiently is proposed. The connected graph derived from the base network is presented using incidence matrix. The rows and columns of the matrix represent the ordered list of zones and ordered list of nets respectivelydoi:10.15623/ijret.2014.0307072 fatcat:tkt55kkednb7hn5dgt6pmwl7tm