graph coloring
Recently Published Documents


TOTAL DOCUMENTS

1078
(FIVE YEARS 208)

H-INDEX

49
(FIVE YEARS 4)

2022 ◽  
Vol 7 ◽  
pp. e836
Author(s):  
Sebastian Mihai Ardelean ◽  
Mihai Udrescu

Genetic algorithms (GA) are computational methods for solving optimization problems inspired by natural selection. Because we can simulate the quantum circuits that implement GA in different highly configurable noise models and even run GA on actual quantum computers, we can analyze this class of heuristic methods in the quantum context for NP-hard problems. This paper proposes an instantiation of the Reduced Quantum Genetic Algorithm (RQGA) that solves the NP-hard graph coloring problem in O(N1/2). The proposed implementation solves both vertex and edge coloring and can also determine the chromatic number (i.e., the minimum number of colors required to color the graph). We examine the results, analyze the algorithm convergence, and measure the algorithm's performance using the Qiskit simulation environment. Our Reduced Quantum Genetic Algorithm (RQGA) circuit implementation and the graph coloring results show that quantum heuristics can tackle complex computational problems more efficiently than their conventional counterparts.


2021 ◽  
pp. 651-658
Author(s):  
Prakash C. Sharma ◽  
Santosh Kumar Vishwakarma ◽  
Nirmal K. Gupta ◽  
Ashish Jain

2021 ◽  
Vol 25 (3) ◽  
Author(s):  
José Carlos Aguilar-Canepa ◽  
Rolando Menchaca-Mendez ◽  
Ricardo Menchaca-Mendez ◽  
Jesus García

2021 ◽  
Author(s):  
Takayuki Itoh ◽  
Asuka Nakabayashi ◽  
Mariko Hagita
Keyword(s):  

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness for integer due dates to the scheduling problem, where along with precedence constraints given on the set of the multiprocessor tasks, a subset of tasks must be processed simultaneously. Contrary to a classical shop-scheduling problem, several processors must fulfill a multiprocessor task. Furthermore, two types of the precedence constraints may be given on the task set . We prove that the extended scheduling problem with integer release times of the jobs to minimize schedule length may be solved as an optimal mixed graph coloring problem that consists of the assignment of a minimal number of colors (positive integers) to the vertices of the mixed graph such that, if two vertices and are joined by the edge , their colors have to be different. Further, if two vertices and are joined by the arc , the color of vertex has to be no greater than the color of vertex . We prove two theorems, which imply that most analytical results proved so far for optimal colorings of the mixed graphs , have analogous results, which are valid for the extended scheduling problems to minimize the schedule length or maximal lateness, and vice versa.


Sign in / Sign up

Export Citation Format

Share Document