Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph / 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 graphs with polynomially solvable maximum-weight clique problem / 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: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses / 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: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPT algorithms for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithms for deletion to split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized polynomial kernel for subset feedback vertex set / 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: Representative Sets and Irrelevant Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression via Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Revision as of 19:47, 17 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
scientific article

    Statements

    Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    maximum induced subgraphs
    0 references
    perfect graphs
    0 references
    co-chordal graphs
    0 references
    randomized FPT algorithms
    0 references
    polynomial kernel lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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