220 search results - page 8 / 44 » Distributed Minimum Cut Approximation |
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
OPODIS
2007
13 years 11 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
SIROCCO
2001
13 years 11 months ago
2001
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
WEA
2005
Springer
14 years 3 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
WG
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...