Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The irredundance number and maximum degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted irredundance of interval graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundance and Maximum Degree in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Hereditary Hypergraphs and Middle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of domination, independence and irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4211755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundant Set Faster Than O(2 n ) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of irredundant sets parameterized by size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two relations between the parameters of independence and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the irredundance number after vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Private Neighbor Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential 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: Q3791195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of the induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Revision as of 09:36, 4 July 2024

scientific article
Language Label Description Also known as
English
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
scientific article

    Statements

    Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 August 2011
    0 references
    graph algorithms
    0 references
    irredundance number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers