Algorithms for graphs embeddable with few crossings per edge

Keyphrases

• Embeddable 100%
• Optimization Problem 50%
• Baker 50%
• Number of Vertices 50%
• Sqrt 50%
• Minimum Dominating Set 50%
• Maximum Independent Set 50%
• Crossing number 50%
• Bounded Genus 50%
• Minimum Vertex Cover 50%
• Balanced Separators 50%
• Polynomial-time Approximation Scheme 50%

INIS

• algorithms 100%
• graphs 100%
• optimization 14%
• size 14%
• approximations 14%
• polynomials 14%
• surfaces 14%

Mathematics

• Edge 100%
• Polynomial Time 33%
• Dominating Set 33%
• Bounded Number 33%
• Maximum Independent Set 33%
• Considered Class 33%