Some sequential graph colouring algorithms for restricted channel routeing
Samar Sen Sarma, RUCHIRA MANDAL, ABHIJIT SETH · International Journal of Electronics · 1994
Channel routeing, as originally envisaged, can be visualized as constrained colouring of a graph, called a horizontal constraint graph. We describe how this can be effective in real-life channel routeing problems with different kinds of simple heuristics. The problem, without heuristics, is actually combinatorially explosive in nature. Compared with certain benchmark problems, the algorithms give encouraging results. The redeeming features of the algorithms presented here are simplicity, with tolerable results at a faster speed and a classical approach reopened.