Graph theory has found its applications in various fields of computation involved in day to day life. A problem solving approach that incorporates graph theory has an added advantage of being simple and visually more comprehensible [9] . Data mining, image processing, astrology and astronomy, theoretical computer science, artificial intelligence and compiler optimization et al., every evolving field utilizes efficient algorithms involving graphs and their properties. Graph coloring has major

more »

... lications in the field of compiler optimization. This paper proposes a heuristic approach of graph coloring for code optimization and hence, improvement in compiler performance and accuracy. Color-based merging of colored graphs reduces the use of temporary variables, increasing efficiency in memory utilization. A comparative analysis has been carried out in order to present the advantages of the proposed algorithm [5] [6] .