19 search results - page 1 / 4 » A Linear Time Algorithm for Finding Three Edge-Disjoint Path... |
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
AAIM
2009
Springer
13 years 11 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
INFOCOM
1991
IEEE
13 years 8 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
WADS
1997
Springer
13 years 9 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...