SIT
发表于 2025-3-27 00:36:02
http://reply.papertrans.cn/23/2300/229974/229974_31.png
红肿
发表于 2025-3-27 04:03:03
Jamal Toutouh,Javier Luque,Enrique Albae .-degenerate induced subgraph enumeration. The time complexity is . time per solution with polynomial preprocessing time and the space complexity is linear in the input graph size, where . and . are the maximum degree and the degeneracy of the input graph.
使虚弱
发表于 2025-3-27 05:50:39
http://reply.papertrans.cn/23/2300/229974/229974_33.png
得罪
发表于 2025-3-27 10:34:41
Sergio Nesmachnow,Luis Hernández Callejonodes. We combine this algorithm with a maximum matching algorithm to obtain a . approximation algorithm for all values of .. We also describe how the mathematical programming formulation we give has several advantages over previous approaches which attempted at finding a subgraph with minimum spectral radius given an edge removal budget.
emulsify
发表于 2025-3-27 17:01:50
Schahram Dustdar,Stefan Nastić,Ognjen Šćekićoblem is .-hard, in parameter ., where . is the number of edge operations and . is the number of vertices to be satisfied. We also show that it is inapproximable to within a factor of .. For certain relaxations of the max-degree constraints, we are able to show constant-factor approximation algorithms for the problem.
PHON
发表于 2025-3-27 19:20:46
http://reply.papertrans.cn/23/2300/229974/229974_36.png
GAVEL
发表于 2025-3-27 21:58:54
https://doi.org/10.1007/978-3-642-20736-5ttack (for example, he/she could exchange some of the cards stealthily when doing such a private action). In contrast, our implementation relies on a familiar shuffling operation called a random cut, and hence, it can be conducted completely publicly so as to avoid any active attack.
不容置疑
发表于 2025-3-28 04:05:09
http://reply.papertrans.cn/23/2300/229974/229974_38.png
prosperity
发表于 2025-3-28 07:48:20
http://reply.papertrans.cn/23/2300/229974/229974_39.png
travail
发表于 2025-3-28 12:10:24
Directed Path-Width of Sequence Digraphs time ., where . denotes the maximum sequence length. This leads to an XP-algorithm w.r.t. . for the directed path-width problem. As most known parameterized algorithms for directed path-width consider the standard parameter, our algorithm improves significantly the known results for a high amount of digraphs of large directed path-width.