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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 354; s. 108 - 121
Hlavní autori:	Ghosal, Subhankar, Ghosh, Sasthi C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.09.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!