An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-015-9969-4 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9969-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2501188539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster parameterized cluster deletion and cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Branching Algorithm for Cluster Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / 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: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter enumerability of cluster editing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative compression and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / 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: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated generation of search tree algorithms for hard graphs modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-015-9969-4 / rank
 
Normal rank

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
scientific article

    Statements

    An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (English)
    0 references
    0 references
    0 references
    22 February 2017
    0 references
    parameterized algorithm
    0 references
    exact algorithm
    0 references
    cluster graph
    0 references
    graph modification
    0 references

    Identifiers