3678 search results - page 142 / 736 » On the Stable Paths Problem |
142
Voted
NETWORKING
2004
15 years 2 months ago
2004
MaxNet is a distributed congestion control architecture in which only the most severely bottlenecked link on the end-to-end path generates the congestion signal that controls the s...
114
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
97
Voted
DAM
2008
15 years 20 days ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
100
Voted
INFORMATICALT
2006
15 years 1 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
149
Voted
MST
2006
15 years 1 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...