On the parameterized complexity of s-club cluster deletion problems (Q6165557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A golden ratio parameterized algorithm for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity of \(s\)-club cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2k\) kernel for the cluster editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tractability of covering a graph with 2-clubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate algorithmics for finding cohesive subnetworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Editing Graphs into 2-Club Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of s-club cluster deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithm for cluster vertex deletion / rank
 
Normal rank

Latest revision as of 12:02, 2 August 2024

scientific article; zbMATH DE number 7720779
Language Label Description Also known as
English
On the parameterized complexity of s-club cluster deletion problems
scientific article; zbMATH DE number 7720779

    Statements

    On the parameterized complexity of s-club cluster deletion problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2023
    0 references
    0 references
    s-Club
    0 references
    cluster deletion problems
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references