External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn. A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. In Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, editors, SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings. Volume 5901 of Lecture Notes in Computer Science, pages 165-175, Springer, 2010. [doi]

Abstract

Abstract is missing.

runs on