Algorithms for weighted graph problems on the modified cellular graph automaton
Algorithms for weighted graph problems on the modified cellular graph automaton
A Modified Cellular Graph Automaton (MCGA) is formulated and algorithms for solving weighted graph problems viz., minimum weight spanning tree construction (based on KruskaVs [5] sequential algorithm) and single source shortest paths (based on Dijkstra's [6] sequential algorithm) are described on it.The original Cellular Graph Automaton (CGA) of Wu and …