Pages that link to "Item:Q527431"
From MaRDI portal
The following pages link to Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431):
Displaying 8 items.
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- Tree pivot-minors and linear rank-width (Q6621185) (← links)
