An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-011-9578-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Proper Interval Colored Graph problem for caterpillar trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Feedback Vertex Set New Measure and New Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / 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: A fixed-parameter approach to 2-layer planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph bandwidth of weighted caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and matching theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quartic Kernel for Pathwidth-One Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Layer Planarization Parameterized by Feedback Edge Set / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-011-9578-2 / rank
 
Normal rank

Latest revision as of 08:57, 11 December 2024

scientific article
Language Label Description Also known as
English
An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
scientific article

    Statements

    An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2012
    0 references
    fixed parameter tractability
    0 references
    kernelization
    0 references
    pathwidth
    0 references
    caterpillar graph
    0 references

    Identifiers