Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A complexity and approximation framework for the maximization scaffolding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers for the stability number and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Revision as of 18:53, 15 July 2024

scientific article
Language Label Description Also known as
English
Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
scientific article

    Statements

    Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2018
    0 references
    complexity
    0 references
    approximation
    0 references
    lower bound
    0 references
    kernel
    0 references
    scaffolding
    0 references

    Identifiers

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