Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2909443810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy Results on the Hardness of $H$-free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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: Fast Quasi-Threshold Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation of strong triadic closure and cluster deletion / 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: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Running Time Lower Bounds for Vertex Deletion Problems / 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: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for module map problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 06:00, 30 July 2024

scientific article; zbMATH DE number 7594854
Language Label Description Also known as
English
Destroying Bicolored $P_3$s by Deleting Few Edges
scientific article; zbMATH DE number 7594854

    Statements

    Destroying Bicolored $P_3$s by Deleting Few Edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2022
    0 references
    NP-hard problem
    0 references
    graph modification
    0 references
    edge-colored graphs
    0 references
    parameterized complexity
    0 references
    graph classes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references