An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
From MaRDI portal
Publication:2914316
DOI10.1007/978-3-642-32241-9_10zbMath1364.68222OpenAlexW1798668903MaRDI QIDQ2914316
Kamil Salikhov, Stepan Artamonov, Maxim A. Babenko
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_10
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Flows in graphs (05C21)
This page was built for publication: An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
