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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Applied Mathematics Ročník 322; s. 74 - 93
Hlavní autoři:	Zhu, Enqiang, Wu, Pu, Shao, Zehui
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 15.12.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!