A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
From MaRDI portal
Publication:3401090
DOI10.1007/978-3-642-11266-9_14zbMath1274.05447arXiv1003.3085OpenAlexW1493358325MaRDI QIDQ3401090
Ilya Razenshteyn, Ignat Kolesnichenko, Maxim A. Babenko
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.3085
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)