Packing Euler graphs with traces

DOI10.1007/978-3-642-29210-1_9zbMath1306.05137OpenAlexW182609420MaRDI QIDQ5176280

Eva-Maria Sprengel, Peter Recht

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_9

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Maximum cycle packing in Eulerian graphs using local traces ⋮ Maximum cycle packing using SPR-trees

Cites Work

• Unnamed Item
• 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
• Approximation algorithms and hardness results for cycle packing problems

This page was built for publication: Packing Euler graphs with traces