A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

DOI10.1007/978-3-642-11266-9_14zbMath1274.05447arXiv1003.3085MaRDI QIDQ3401090

Ignat Kolesnichenko, Ilya Razenshteyn, 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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C38: Paths and cycles

05C85: Graph algorithms (graph-theoretic aspects)