Pages that link to "Item:Q854832"
From MaRDI portal
The following pages link to Quickly deciding minor-closed parameters in general graphs (Q854832):
Displaying 5 items.
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- The complexity of learning minor closed graph classes (Q6083915) (← links)