Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2102753
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs
Cited in
(13)- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
- The longest common subsequence problem for sequences with nested arc annotations.
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
- Improved induced matchings in sparse graphs
- scientific article; zbMATH DE number 4090822 (Why is no real title available?)
- scientific article; zbMATH DE number 1979505 (Why is no real title available?)
- Thin graph classes and polynomial-time approximation schemes
- scientific article; zbMATH DE number 2102753 (Why is no real title available?)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs
- Improved induced matchings in sparse graphs
This page was built for publication: Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377126)
