Proportional Cram on Crooked Crisscross for N-Hop Systems
Computer network is converted to a grid and is illustrated with a program dependence graph. Both maximum and minimum level degree based program dependence graph is generated and a proportional study is made on irregular grids. Additionally, graph coloring procedure is also incorporated into it to amplify the recital of the network.
KeywordsGraph theory N-Hop Network Program dependence graph Shortest trail
The authors would like to thank Dr. Ponnammal Natarajan, Former Director of Research and Development, Anna University, Chennai, India for her intuitive ideas and fruitful discussions with respect to the paper’s contribution and support to complete this paper.