Maximum cycle packing in Eulerian graphs using local traces
From MaRDI portal
Publication:2259574
DOI10.7151/dmgt.1785zbMath1307.05125OpenAlexW2083301492MaRDI QIDQ2259574
Eva-Maria Sprengel, Peter Recht
Publication date: 4 March 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1785
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for grooming in optical network design
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- Packing disjoint cycles over vertex cuts
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- A problem regarding the tracing of graphs
- Über eine spezielle Klasse Eulerscher Graphen
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Packing cycles in undirected graphs
- Genome Rearrangements and Sorting by Reversals
- Packing Euler graphs with traces