30 citations · 158 across the 36 of their papers we have counts for
1 paper · 1 filter
Manuel Sorge
A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian extension (EE) where a directed mult…