Maximum cycle packing using SPR-trees

Maximum cycle packing using SPR-trees

<p>Let <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> be an undirected multigraph without loops. The maximum cycle packing problem is to find a collection <span class="math"><em>Z</em> *  = {...

Full description

Bibliographic Details
Main Authors: Christin Otto, Peter Recht
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
maximum cycle packing, decomposition, spr-trees, edge-disjoint cycle
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/346

Internet

https://www.ejgta.org/index.php/ejgta/article/view/346

Similar Items