1 paper · 2 filters
Matthijs Ebbens, Francis Lazarus
Given a weighted, undirected graph G cellularly embedded on a topological surface S, we describe algorithms to compute the second shortest and third shortest closed walks of $G…