1 citations · 1 across the 1 of their papers we have counts for
1 paper
Pedro O. Pinheiro, Alexsandro Oliveira Alexandrino, Andre R. Oliveira +2
Given an Eulerian graph G, in the Maximum Eulerian Cycle Decomposition problem, we are interested in finding a collection of edge-disjoint cycles {E_1, E_2, ..., E_k} in G such tha…