233 search results - page 3 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
111
Voted
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
108
Voted
CORR
2008
Springer
15 years 19 days ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
73
Voted
EOR
2008
15 years 18 days ago
2008
Given arbitrary source and target nodes s, t and an s
110
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,...
84
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...