scientific article; zbMATH DE number 1947048

MaRDI QIDQ4411278zbMATH OpenFDO

Authors Erik D. Demaine, Dimitrios M. Thilikos, Mohammad T. Hajiaghayi

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620067.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
• A c^k n 5-approximation algorithm for treewidth
• Approximation algorithms for treewidth
• Local tree-width, excluded minors, and approximation algorithms

Cited in

(7)

• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Max-Cut and containment relations in graphs
• Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
• \textsc{max-cut} and containment relations in graphs
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• Linearity of grid minors in treewidth with applications through bidimensionality

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411278)