[SPARK-29744] Add graph coloring algorithm

• Type: Task
• Status: Open
• Priority: Minor
• Resolution: Unresolved
• Affects Version/s: 3.0.0
• Component/s: GraphX
• Assignee: Unassigned
• Reporter: Michał Podstawski
• Created: 04/Nov/19 17:23
• Updated: 04/Nov/19 17:39

Description

Amongst implemented in GraphX algorithm there is graph coloring missing. It should be added. At the beginning we can use simply greedy heuristic. In the next step we can consider implementing ie Boman graph coloring - https://www.researchgate.net/profile/Erik_Boman2/publication/221148539_A_Parallel_Distance-2_Graph_Coloring_Algorithm_for_Distributed_Memory_Computers/links/0912f50caa8822e82d000000.pdf