Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent feedback vertex set for \(P_5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing subset transversals in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing weighted subset transversals in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle transversals and their connected variants in the absence of a small linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large induced sparse subgraphs in <i> c <sub>&gt;t</sub> </i> -free graphs in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex cover for \((sP_1+P_5)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination versus weighted independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Even Cycle Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On line graphs of subcubic triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying subset feedback vertex set for \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex set on graphs of bounded independent set size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank

Latest revision as of 00:17, 29 July 2024

scientific article
Language Label Description Also known as
English
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
scientific article

    Statements

    Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2022
    0 references
    odd cycle transversal
    0 references
    \(H\)-free graph
    0 references
    complexity dichotomy
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers