549 search results - page 8 / 110 » Computing All the Best Swap Edges Distributively |
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
ISHPC
2000
Springer
15 years 1 months ago
2000
Springer
Isosurface generation algorithms usually need a vertex-identification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the...
ISCAS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
NETWORKING
2004
14 years 11 months ago
2004
In this paper, we present a distributed flow control scheme which achieves weighted max-min fair bandwidth allocation among all source-destination pairs on a per-aggregate basis wi...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...