Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
Electronic Notes in Discrete Mathematics(2001)
摘要
Abstract We prove that any graph excluding one of K 5 or K 3, 3 as a minor has local treewidth bounded by 3k + 4. As a result, we can design practical polynomial-time approximation schemes for both minimization and maximization problems on these classes of non-planar graphs.
更多查看译文
关键词
np hard problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络