Parameterized algorithms for editing to uniform cluster graph

DOI10.1007/978-3-032-04700-7_13MaRDI QIDQ6852229zbMATH OpenFDO

Authors Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_13

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A fast branching algorithm for cluster vertex deletion
• A kernelization algorithm for \(d\)-hitting set
• A more effective linear kernelization for cluster editing
• Bounded-degree techniques accelerate some parameterized graph algorithms
• Cluster deletion revisited
• Cluster editing: kernelization based on edge cuts
• Even faster parameterized cluster deletion and cluster editing
• Faster parameterized algorithm for cluster vertex deletion
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 7803591 (Why is no real title available?)
• On characterizing certain graphs with four eigenvalues by their spectra
• On split graphs with four distinct eigenvalues
• On the complexity of the eigenvalue deletion problem

This page was built for publication: Parameterized algorithms for editing to uniform cluster graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852229)