A carregar...
Multi-Threading a State-of-the-Art Maximum Clique Algorithm
We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common. We include results for several previously unsolved benchmark...
Na minha lista:
Main Authors: | , |
---|---|
Formato: | Artigo |
Idioma: | Inglês |
Publicado em: |
MDPI AG
2013-10-01
|
Colecção: | Algorithms |
Assuntos: | |
Acesso em linha: | http://www.mdpi.com/1999-4893/6/4/618 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|