Titlebook: Computing and Combinatorics; 29th International C Weili Wu,Guangmo Tong Conference proceedings 2024 The Editor(s) (if applicable) and The A

sultry

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.

顯微鏡

費(fèi)解