The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver

DOI10.1007/978-3-030-10564-8_16OpenAlexW2906642224MaRDI QIDQ2327525

Shuji Jimbo, Akira Maruoka

Publication date: 15 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-10564-8_16

zbMATH Keywords

graph theorycomplete graphscomputer experimentsEulerian circuitsshortest subcycles

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver