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

DOI10.1006/jagm.1997.0894zbMath0891.68070OpenAlexW2043745737MaRDI QIDQ4377126

Zhi-Zhong Chen

Publication date: 19 July 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

maximum induced subgraph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

The longest common subsequence problem for sequences with nested arc annotations., Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Improved induced matchings in sparse graphs, Improved Induced Matchings in Sparse Graphs, Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application., Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs