A new vertex coloring algorithm based on variable action-set learning automata
JA Torkestani, MR Meybodi - Computing and Informatics, 2010 - cai.sk
In this paper, we propose a learning automata-based iterative algorithm for approximating a
near optimal solution to the vertex coloring problem. Vertex coloring is a well-known NP-
hard optimization problem in graph theory in which each vertex is assigned a color so that
no two adjacent ertices have the same color. Each iteration of the proposed algorithm is
subdivided into several stages, and at each stage a subset of the uncolored non adjacent
vertices are randomly selected and assigned the same color. This process continues until no …
near optimal solution to the vertex coloring problem. Vertex coloring is a well-known NP-
hard optimization problem in graph theory in which each vertex is assigned a color so that
no two adjacent ertices have the same color. Each iteration of the proposed algorithm is
subdivided into several stages, and at each stage a subset of the uncolored non adjacent
vertices are randomly selected and assigned the same color. This process continues until no …
[PDF][PDF] A NEW VERTEX COLORING ALGORITHM BASED ON VARIABLE ACTION-SET LEARNING AUTOMATA
MR Meybodi - Citeseer
In this paper, we propose a learning automata-based iterative algorithm for approximating a
near optimal solution to the vertex coloring problem. Vertex coloring is a well-known NP-
hard optimization problem in graph theory in which each vertex is assigned a color so that
no two adjacent vertices have the same color. Each iteration of the proposed algorithm is
subdivided into several stages, and at each stage a subset of the uncolored non adjacent
vertices are randomly selected and assigned the same color. This process continues until no …
near optimal solution to the vertex coloring problem. Vertex coloring is a well-known NP-
hard optimization problem in graph theory in which each vertex is assigned a color so that
no two adjacent vertices have the same color. Each iteration of the proposed algorithm is
subdivided into several stages, and at each stage a subset of the uncolored non adjacent
vertices are randomly selected and assigned the same color. This process continues until no …
以上显示的是最相近的搜索结果。 查看全部搜索结果