Parameterized aspects of strong subgraph closure (Q2182097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1802.10386 / 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: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / 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: Incompressibility of \(H\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing FPT Algorithms for Cut Problems Using Randomized Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong triadic closure in cographs and graphs of low maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5136273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two edge modification problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 17:29, 22 July 2024

scientific article
Language Label Description Also known as
English
Parameterized aspects of strong subgraph closure
scientific article

    Statements

    Parameterized aspects of strong subgraph closure (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2020
    0 references
    strong triadic closure
    0 references
    parameterized complexity
    0 references
    forbidden subgraphs
    0 references

    Identifiers