Expected polynomial-time randomized algorithm for graph coloring problem

Given a graph G=(V,E) with n=|V| vertices, the graph coloring problem is defined as Find a color vectorC=(c(v)), where c(v)∈{1,2,…,n} denotes the color of vertex v∈V, such that no monochromatic edge exists in G and the span, the total number of distinct colors in C, is minimized. Since the problem i...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 354; pp. 108 - 121
Main Authors:	Ghosal, Subhankar, Ghosh, Sasthi C.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.09.2024
Subjects:	Equivalent order Expected polynomial time Graph coloring Greedy coloring Heuristic Pseudo-vertex Expected polynomial time Pseudo-vertex Greedy coloring Graph coloring Equivalent order Heuristic
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!