[HTML][HTML] A survey of parameterized algorithms and the complexity of edge modification
The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …
algorithms for graph modification problems. It describes state of the art in kernelization …
Graph theory analysis of the cortical functional network during sleep in patients with depression
Y Song, K Wang, Y Wei, Y Zhu, J Wen, Y Luo - Frontiers in Physiology, 2022 - frontiersin.org
Depression, a common mental illness that seriously affects the psychological health of
patients, is also thought to be associated with abnormal brain functional connectivity. This …
patients, is also thought to be associated with abnormal brain functional connectivity. This …
An improved kernelization algorithm for Trivially Perfect Editing
M Dumas, A Perez - arXiv preprint arXiv:2306.16899, 2023 - arxiv.org
In the Trivially Perfect Editing problem one is given an undirected graph $ G=(V, E) $ and an
integer $ k $ and seeks to add or delete at most $ k $ edges in $ G $ to obtain a trivially …
integer $ k $ and seeks to add or delete at most $ k $ edges in $ G $ to obtain a trivially …
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
In this work, we initiate the complexity study of Biclique Contraction and Balanced Biclique
Contraction. In these problems, given as input a graph G and an integer k, the objective is to …
Contraction. In these problems, given as input a graph G and an integer k, the objective is to …
Modification et couverture de graphes: Approches paramétrées
M Dumas - 2023 - theses.hal.science
Cette thèse traite de problèmes de modification d'arêtes et de couverture de graphes par
des plus courts chemins dans le cadre de la complexité paramétrée. Dans un problème de …
des plus courts chemins dans le cadre de la complexité paramétrée. Dans un problème de …