Skip to content

Author

Deniz Canturk

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Review Open access Sep 2026

A New Metaheuristic Algorithm for Large Graph Coloring Problems

The Graph Coloring Problem (GCP) is an NP-hard combinatorial optimization problem that involves assigning colors to the vertices of a graph such that no two adjacent vertices share the same color. Due to its computational complexity, exact algorithms are often impractical for solving large-scale instances within reason...

Tansel Dokeroglu, Deniz Canturk · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.