1389 search results - page 9 / 278 » Parallel Algorithms for Treewidth Two |
PPAM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computa...
COMBINATORICA
2010
13 years 3 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
COR
2006
13 years 8 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
PDCAT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...