Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

115

Voted

SOFSEM
2010
Springer

157views Theoretical Computer Science» more SOFSEM 2010»

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

15 years 11 months ago

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

Download www.sofsem.cz

Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P.

Real-time Traffic

SOFSEM 2010 | Theoretical Computer Science |

claim paper

Related Content

» Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge D...

» Three Results on Frequency Assignment in Linear Cellular Networks

» On Multicast Path Finding Algorithms

» Finding Cores of Limited Length

» Improved Lightpath Wavelength Routing in Large WDM Networks

» Route Planning with Flexible Objective Functions

» Pointtopoint shortest paths on dynamic timedependent road networks

» Delay constrained minimum energy broadcast in cooperative wireless networks

» Active learning for Hidden Markov Models objective functions and algorithms

Post Info
More Details (n/a)

Added	17 Mar 2010
Updated	17 Mar 2010
Type	Conference
Year	2010
Where	SOFSEM
Authors	Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn

Comments (0)