A pseudo-approximation for the genus of Hamiltonian graphs
DOI10.4086/TOC.2017.V013A005zbMATH Open1379.68356OpenAlexW2261767097MaRDI QIDQ5368902FDOQ5368902
Amir Nayyeri, Yury Makarychev, Anastasios Sidiropoulos
Publication date: 11 October 2017
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2017.v013a005
Recommendations
- A pseudo-approximation for the genus of Hamiltonian graphs
- Beyond the Euler characteristic: approximating the genus of general graphs (extended abstract)
- Approximation algorithms for Euler genus and related problems
- A note on approximating graph genus
- [[:Publication:4261776|Title not available (Why is that?)]]
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cited In (1)
This page was built for publication: A pseudo-approximation for the genus of Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368902)
