Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs

DOI10.1016/S1571-0653(04)00379-8zbMath1184.05118OpenAlexW1977677776MaRDI QIDQ3438969

Naomi Nishimura, Dimitrios M. Thilikos, Prabhakar Ragde, Mohammad Taghi Hajiaghayi

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00379-8

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• A partial k-arboretum of graphs with bounded treewidth
• Diameter and treewidth in minor-closed graph families
• Parallel approximation schemes for problems on planar graphs
• Partitioning Planar Graphs
• Approximation algorithms for NP-complete problems on planar graphs
• Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs