214 search results - page 8 / 43 » The node capacitated graph partitioning problem: A computati... |
203
Voted
SPAA
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
99
Voted
SBACPAD
2003
IEEE
15 years 6 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
118
Voted
ENDM
2010
15 years 27 days ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
116
click to vote
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...