92 search results - page 6 / 19 » Application of Fusion-Fission to the Multi-way Graph Partiti... |
152
click to vote
SBACPAD
2003
IEEE
15 years 11 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
183
click to vote
CORR
2011
Springer
15 years 18 days ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
165
Voted
EVOW
2004
Springer
15 years 11 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 ...
170
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
136
Voted
WG
2009
Springer
16 years 5 days ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...