scientific article; zbMATH DE number 2230213

MaRDI QIDQ5708499zbMATH OpenFDO

Authors

Publication date 18 November 2005

Full work available at URL http://www.sciencedirect.com/science/journal/15710653

Mathematics Subject Classification ID

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

Cites work

• A Better Approximation Algorithm for Finding Planar Subgraphs
• Crossing Number is NP-Complete
• Edge-Deletion Problems
• scientific article; zbMATH DE number 3668651 (Why is no real title available?)
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• Node-and edge-deletion NP-complete problems
• On the complexity of the approximation of nonplanarity parameters for cubic graphs
• Optimization, approximation, and complexity classes
• SPLITTING NUMBER is NP-complete
• The graph genus problem is NP-complete

Cited in

(1)

• Approximation algorithms for Euler genus and related problems

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 Q5708499)