86 search results - page 3 / 18 » The Computational Complexity of the Minimum Weight Processor... |
CIAC
2000
Springer
13 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
STACS
2004
Springer
13 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
CSC
2006
13 years 7 months ago
2006
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...
SOFSEM
2007
Springer
14 years 10 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...