A practical algorithm for the computation of the genus
Ars mathematica contemporanea, Volume 22 (2022) no. 4, article no. 01, 14 p.
See the original article notice from the Ars Mathematica Contemporanea website source
We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algorithms. The aim of this algorithm is to be fast enough for many applications instead of focusing on the theoretical asymptotic complexity.Apart from the specific problem and the results, the article can also be seen as an example how some design principles used to carefully develop and implement standard backtracking algorithms can still result in very competitive programs.
Gunnar Brinkmann. A practical algorithm for the computation of the genus. Ars mathematica contemporanea, Volume 22 (2022) no. 4, article no. 01, 14 p.. doi: 10.26493/1855-3974.2320.c2d
@article{10_26493_1855_3974_2320_c2d,
author = {Gunnar Brinkmann},
title = {
{A} practical algorithm for the computation of the genus
},
journal = {Ars mathematica contemporanea},
eid = {01},
year = {2022},
volume = {22},
number = {4},
doi = {10.26493/1855-3974.2320.c2d},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2320.c2d/}
}
TY - JOUR AU - Gunnar Brinkmann TI - A practical algorithm for the computation of the genus JO - Ars mathematica contemporanea PY - 2022 VL - 22 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2320.c2d/ DO - 10.26493/1855-3974.2320.c2d LA - en ID - 10_26493_1855_3974_2320_c2d ER -
Cited by Sources: