Sciweavers

1090 search results - page 10 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 22 days ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
14 years 2 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
14 years 22 days ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
WG
1998
Springer
13 years 11 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
PPAM
2007
Springer
14 years 1 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot