Pages that link to "Item:Q1880778"
From MaRDI portal
The following pages link to Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778):
Displaying 9 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
