Dynamic thresholding search for the feedback vertex set problem

Given a directed graph G = (V, E), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic. The feedback vertex set problem is to find the subset C* whose cardinality is the minimum. As a general model, this problem has a variety of applications. However, the problem is kn...

Descripción completa

Detalles Bibliográficos
Autores principales: Sun, Wen, Hao, Jin-Kao, Wu, Zihao, Li, Wenlong, Wu, Qinghua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2023
Materias:
Algorithms and Analysis of Algorithms
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280643/
https://www.ncbi.nlm.nih.gov/pubmed/37346631
http://dx.doi.org/10.7717/peerj-cs.1245

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280643/
https://www.ncbi.nlm.nih.gov/pubmed/37346631
http://dx.doi.org/10.7717/peerj-cs.1245

Ejemplares similares