Maximum cycle packing using SPR-trees

Otto, C; Recht, P

Otto, C (reprint author), TU Dortmund, Operat Res & Business Informat, D-44221 Dortmund, Germany.

ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2019; 7 (1): 147

Abstract

Let G = (V, E) be an undirected multigraph without loops. The maximum cycle packing problem is to find a collection Z* = {C-1,...,C-s} of edge-disjoin......

Full Text Link