Pages that link to "Item:Q4377126"
From MaRDI portal
The following pages link to Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs (Q4377126):
Displaying 10 items.
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- (Q4425961) (← links)
