From post

Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem.

, и . Recent Advances in Evolutionary Computation for Combinatorial Optimization, том 153 из Studies in Computational Intelligence, Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Increasing the Efficiency of Graph Colouring Algorithms with a Representation Based on Vector Operations., и . J. Softw., 1 (2): 24-33 (2006)Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring., , и . EvoCOP, том 3448 из Lecture Notes in Computer Science, стр. 132-143. Springer, (2005)Binary Merge Model Representation of the Graph Colouring Problem., , и . EvoCOP, том 3004 из Lecture Notes in Computer Science, стр. 124-134. Springer, (2004)Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem., и . Recent Advances in Evolutionary Computation for Combinatorial Optimization, том 153 из Studies in Computational Intelligence, Springer, (2008)Quotient and power methods for the graph colouring problem. University of Szeged, Hungary, (2010)Graph Colouring Heuristics Guided by Higher Order Graph Properties., и . EvoCOP, том 4972 из Lecture Notes in Computer Science, стр. 97-109. Springer, (2008)Intelligent Forecast with Dimension Reduction., и . WSC, том 34 из Advances in Soft Computing, стр. 279-292. Springer, (2004)Forecasting of traffic origin NO and NO2 concentrations by Support Vector Machines and neural networks using Principal Component Analysis, , и . Simulation Modelling Practice and Theory, 16 (9): 1488 - 1502 (2008)Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation., и . EvoCOP, том 3906 из Lecture Notes in Computer Science, стр. 123-134. Springer, (2006)