Sciweavers

86 search results - page 3 / 18
» The Computational Complexity of the Minimum Weight Processor...
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 10 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
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 ...
Narsingh Deo, Ayman Abdalla
STACS
2005
Springer
13 years 11 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
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 ...
Telikepalli Kavitha, Kurt Mehlhorn
STACS
2004
Springer
13 years 11 months ago
On Minimum Circular Arrangement
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...
Murali K. Ganapathy, Sachin Lodha
CSC
2006
13 years 7 months ago
Parallel Load Balancing Heuristics for Radiative Heat Transfer Calculations
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...
Kamal Viswanath, Ivana Veljkovic, Paul E. Plassman...
SOFSEM
2007
Springer
14 years 10 days ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
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 ...
Markus Maier, Steffen Mecke, Dorothea Wagner