Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Abstract

Full Citation:

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 1-16, 2016, Springer.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.