11 citations · 29 across the 12 of their papers we have counts for
1 paper · 1 filter
Manlio Valenti
We characterize the uniform computational strength of finding (one-way or two-way, directed or undirected) Eulerian paths in countable graphs. In the one-way case, for both directe…