420 search results - page 10 / 84 » Search on High Degree Graphs |
WEA
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
MFCS
2004
Springer
14 years 23 days ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
PPSC
1997
13 years 8 months ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...