2125 search results - page 234 / 425 » On Graph Complexity |
121
Voted
MICS
2010
15 years 1 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
137
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
140
Voted
SAC
2005
ACM
15 years 9 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
143
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
131
Voted
CLUSTER
2005
IEEE
15 years 9 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, ...