Distributed Potential Game Optimization to 3-Path Vertex Cover of Networks

3-path vertex cover of networks is a typical optimization problem in network science, which has a wide range of applications. Toward a 3-path vertex cover of networks from distributed optimization, we first established a potential game to describe the 3-path vertex cover problem. Next, we analyze th...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on automation science and engineering Ročník 22; s. 20649 - 20666
Hlavní autoři:	Chen, Jie, Wu, Jie, Zhou, Rongpei, Gui, Weihua
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 2025
Témata:	3-path vertex cover Analytical models Approximation algorithms Artificial intelligence Automation bounded best response Complexity theory Cost function Distributed algorithms distributed potential game Games memory length Nash equilibrium Numerical models strict Nash equilibrium
ISSN:	1545-5955, 1558-3783
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!