Exact algorithms for counting 3-colorings of graphs

Graph Coloring Problem, as one of the best known NP-complete problems, has been extensively studied by researchers in a wide range of fields, leading to many applications and theories in mathematics and computer science. In this paper, we focus on the design of exact algorithms for counting 3-colori...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 322; S. 74 - 93
Hauptverfasser:	Zhu, Enqiang, Wu, Pu, Shao, Zehui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.12.2022
Schlagworte:	3-Coloring Branch and reduce Dynamic programming Exact exponential-time algorithms Measure and conquer Measure and conquer Branch and reduce 3-Coloring Dynamic programming Exact exponential-time algorithms
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!