sultry
发表于 2025-4-1 02:53:39
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphsmaining graph a cluster, i.e., a graph with each connected component being a complete graph. In this paper, we show that . can be solved in . time, improving the previous result of .. To obtain this result, one crucial step is to show . on graphs of maximum degree at most 4 can be solved in . time.
显微镜
发表于 2025-4-1 06:41:38
http://reply.papertrans.cn/24/2348/234780/234780_62.png
费解
发表于 2025-4-1 13:32:16
http://reply.papertrans.cn/24/2348/234780/234780_63.png