The following pages link to (Q5391139):
Displaying 4 items.
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)