Algorithms icon indicating copy to clipboard operation
Algorithms copied to clipboard

Published 20 hours ago • verified publisher icon Kumar-laxmi

Graph Coloring Algorithms

Open venom2003op opened this issue 1 year ago • 3 comments

Greedy Coloring Algorithm: The greedy coloring algorithm assigns colors to vertices one by one, using the smallest possible color that is not used by any of its neighboring vertices. It is a simple and fast algorithm.

Backtracking Algorithms: Backtracking algorithms such as the DSatur algorithm and the Welsh-Powell algorithm aim to find the minimum number of colors required to color a graph by exploring different color assignments and backtracking when a conflict arises.

I would like to request the project admin to assign me this issue under SSOC I would like to work on this issue under SSOC'23.

venom2003op avatar Jun 02 '23 14:06 venom2003op

Please assign this issue to me.

kamalyash2002 avatar Jun 04 '23 12:06 kamalyash2002

Please assign this issue to me.

ManmayGhosh avatar Jun 05 '23 16:06 ManmayGhosh

please assign this issue to me

bhagvadgita avatar Jun 22 '23 13:06 bhagvadgita

This issue has been automatically closed because it has been inactive for many days. Please reopen if you still intend on working on this problem

github-actions[bot] avatar Jul 26 '24 16:07 github-actions[bot]