Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs

DOI10.1006/JAGM.1997.0894MaRDI QIDQ4377126zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen

Publication date 19 July 1998

Published in (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0894

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.

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

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)