Pages that link to "Item:Q3614205"
From MaRDI portal
The following pages link to Matroid Pathwidth and Code Trellis Complexity (Q3614205):
Displaying 15 items.
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- (Q2857402) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- The “Art of Trellis Decoding” Is NP-Hard (Q5386095) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- Pathwidth vs Cocircumference (Q6195950) (← links)
- Tree pivot-minors and linear rank-width (Q6621185) (← links)
