2 citations · 2 across the 6 of their papers we have counts for
1 paper · 1 filter
Rui Ferreira, Roberto Grossi, Andrea Marino +3
We present the first optimal algorithm for the classical problem of listing all the cycles in an undirected graph. We exploit their properties so that the total cost is the time ta…