Stronger ILPs for the Graph Genus Problem.
From MaRDI portal
Publication:5075767
DOI10.4230/LIPIcs.ESA.2019.30OpenAlexW2977248298MaRDI QIDQ5075767
Publication date: 11 May 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11151/pdf/LIPIcs-ESA-2019-30.pdf/
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Errors in graph embedding algorithms
- On the genus of the complete tripartite graph \(K_{n, n, 1}\)
- Genus of the Cartesian product of triangles
- Embeddings of graphs with no short noncontractible cycles
- The Cartesian product of three triangles can be embedded into a subspace of genus 7
- On the genus of \({\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\)
- On the genus of the graph \(K_n\times K_2\) or the n-prism
- The genus of the Gray graph is 7
- On embeddings of circulant graphs
- Das Geschlecht des vollständigen paaren Graphen
- An experimental comparison of four graph drawing algorithms.
- Das Geschlecht des vollständigen dreifärbbaren Graphen
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Genus characterizes the complexity of certain graph problems: Some tight results
- A Pseudo-approximation for the Genus of Hamiltonian Graphs
- Beyond the Euler Characteristic
- The graph genus problem is NP-complete
- The Bidimensional Theory of Bounded-Genus Graphs
- On the genus of the semidirect product of ℤ9 by ℤ3
- The genus of the n‐octahedron: Regular cases
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
- On the genus of star graphs
- Approximation Algorithms for Euler Genus and Related Problems
- Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
- The dominating set problem is fixed parameter tractable for graphs of bounded genus
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The genus of the complete tripartite graph Kmn,n,n
