108 search results - page 4 / 22 » Improved bounds and algorithms for graph cuts and network re... |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
GC
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...