Simple greedy 2-approximation algorithm for the maximum genus of a graph
From MaRDI portal
Publication:6593569
DOI10.4230/OASICS.SOSA.2019.14zbMATH Open1547.68617MaRDI QIDQ6593569
Author name not available (Why is that?)
Publication date: 26 August 2024
No records found.
No records found.
This page was built for publication: Simple greedy 2-approximation algorithm for the maximum genus of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593569)