search

Kumar-laxmi / Algorithms

A Repository for algorithms in C, C++, Python and Java
Apache License 2.0
320 stars 366 forks source link

Graph Coloring Algorithms #909

Closed venom2003op closed 2 months ago

venom2003op commented 1 year ago

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.

kamalyash2002 commented 1 year ago

Please assign this issue to me.

ManmayGhosh commented 1 year ago

Please assign this issue to me.

bhagvadgita commented 1 year ago

please assign this issue to me

github-actions[bot] commented 2 months ago

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