1101 search results - page 138 / 221 » An Algorithm for the Graph Crossing Number Problem |
133
Voted
ESA
1998
Springer
15 years 6 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
115
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
123
Voted
CLUSTER
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
104
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
131
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...