An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914383530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for linear rank-width at most 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit interval editing is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations characterizing rank-width / 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: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Kernel for Proper Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rota's conjecture and excluded minors containing large projective geometries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 3-connected matroids of path width three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithm for path-width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering of matrices under Schur complement and applications to directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Pathwidth and Code Trellis Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar obstructions for matroid pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / 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: Measuring Indifference: Unit Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper interval vertex deletion / rank
 
Normal rank

Latest revision as of 13:15, 14 July 2024

scientific article
Language Label Description Also known as
English
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
scientific article

    Statements

    An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    linear rankwidth
    0 references
    rankwidth
    0 references
    cliquewidth
    0 references
    thread graph
    0 references
    necklace graph
    0 references
    0 references
    0 references
    0 references