About parallelization of an algorithm for the maximum clique problem


Монев, Венелин (2013) About parallelization of an algorithm for the maximum clique problem Seventh International Workshop on Optimal Codes and Related Topics September 6-12, 2013, Albena


 Many construction and classification problems in coding theory can be considered as a maximum clique problem. In this paper we consider some approaches for parallel implementation of an algorithm which solves this problem.
  Доклад
 parallel programming, graph, clique




 Издадено
  15449
 Венелин Монев

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/