Heuristic approach for bandwidth consecutive multi-coloring problem

Bandwidth consecutive multicoloring problem is also known as a b-coloring problem. Let G = (V, E) be a graph where V is the set of vertices and E is the set of edges. Let each vertex v of V has a positive integer weight b (v) and each edge (v, w) of E has a non-negative integer weight b (v, w). A ba...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of intelligent & fuzzy systems 2023-12, Vol.45 (6), p.9991-10002
Hauptverfasser:	Srivastava, Stuti, Bansal, Richa, Thapar, Antika
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive search techniques Algorithms Apexes Bandwidths Coloring Graph theory Graphs Heuristic methods Integers Numbers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!