20 search results - page 3 / 4 » Edge Partitioning in External-Memory Graph Search |
104
click to vote
GECCO
2008
Springer
15 years 8 days ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
EVOW
2004
Springer
15 years 4 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
108
click to vote
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
105
click to vote
NETWORKS
2007
14 years 10 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
TCS
2008
14 years 11 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...