688 search results - page 63 / 138 » General Partitioning on Random Graphs |
72
Voted
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
102
Voted
HPDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
113
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
92
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...