1172 search results - page 85 / 235 » Path Algorithms on Regular Graphs |
106
click to vote
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
104
Voted
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
132
Voted
ICCS
2004
Springer
15 years 5 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...
103
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
109
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...