Mim-width. II. The feedback vertex set problem (Q2285053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127447102, #quickstatements; #temporary_batch_1722543333430
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963520829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON DISJOINT CYCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on graphs of low clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. I. Induced path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on AT-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: Q5009483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed parameter tractable algorithms for finding feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polygon numbers of circle graphs and distance hereditary graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127447102 / rank
 
Normal rank

Latest revision as of 21:17, 1 August 2024

scientific article
Language Label Description Also known as
English
Mim-width. II. The feedback vertex set problem
scientific article

    Statements

    Mim-width. II. The feedback vertex set problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2020
    0 references
    graph width parameters
    0 references
    mim-width
    0 references
    graph classes
    0 references
    feedback vertex set
    0 references
    0 references
    0 references
    0 references
    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