Complexity and parameterized algorithms for cograph editing (Q690461): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008978934 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56475005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / 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: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / 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: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bicluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Branching Strategy for Parameterized Graph Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / 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: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank

Latest revision as of 21:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity and parameterized algorithms for cograph editing
scientific article

    Statements

    Complexity and parameterized algorithms for cograph editing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    cograph editing
    0 references
    NP-hardness
    0 references
    parameterized algorithms
    0 references
    \(P_{4}\)-sparse graph
    0 references

    Identifiers