Implementation of Sequential and Parallel Graph Coloring Algorithms using greedy approach and NetworkX library. Compares two different strategies: traditional sequential coloring and optimized parallel coloring with largest-first heuristic.
algorithmgraph-theoryparallel-algorithmgreedy-algorithmgraph-coloringsequential-algorithmgraph-coloring-problem
-
Updated
Jan 4, 2026 - Python