Further reading

1. Apache Giraph: An iterative graph processing system built for high scalability. URL: https://giraph.apache.org/.
2. Chaitin, G. J.: Register Allocation & Spilling via Graph Coloring. In: Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, SIGPLAN '82. New York, NY, USA : ACM, 1982 — ISBN 0-89791-074-5, S. 98–105.
3. Floyd, Robert W.: Algorithm 97: Shortest Path. In: Commun. ACM Bd. 5. New York, NY, USA, ACM (1962), Nr. 6, S. 345
4. GPS: A graph processing system. URL: http://infolab.stanford.edu/gps.

5. Hart, P. E. ; Nilsson, N. J. ; Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. In: IEEE Transactions on Systems Science and Cybernetics Bd. 4 (1968), Nr. 2, S. 100–107.
6. Jones, Mark T. ; Plassmann, Paul E.: A Parallel Graph Coloring Heuristic. In: SIAM J. Sci. Comput. Bd. 14. Philadelphia, PA...