scientific article; zbMATH DE number 2230213

zbMath1075.05602MaRDI QIDQ5708499

No author found.

Publication date: 18 November 2005

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (1)

Approximation Algorithms for Euler Genus and Related Problems

Cites Work

• Optimization, approximation, and complexity classes
• On the complexity of the approximation of nonplanarity parameters for cubic graphs
• The graph genus problem is NP-complete
• Crossing Number is NP-Complete
• Edge-Deletion Problems
• A Better Approximation Algorithm for Finding Planar Subgraphs
• Node-and edge-deletion NP-complete problems
• SPLITTING NUMBER is NP-complete
• Unnamed Item
• Unnamed Item

This page was built for publication: