A Grover search-based algorithm for the list coloring problem
Sayan Mukherjee
Abstract:Graph coloring is a computationally difficult problem, and currently the best known classical algorithm for k-coloring of graphs on n vertices has runtimes Ω(2 n ) for k ≥ 5. The list coloring problem asks the following more general question: given a list of available colors for each vertex in a graph, does it admit a proper coloring? We propose a quantum algorithm based on Grover search [11] to quadratically speed up exhaustive search. Our algorithm loses in complexity to classical ones in specific restricted… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.