Research on Maximum Clique Identification Based on Parallel Constraint Programming
To improve the efficiency of solving the Maximum Clique Problem(MCP) of large-scale legends on big data platforms,this paper proposes a maximum clique identification algorithm based on parallel constraint programming.The BMT graph division strategy is used to divide a complex graph into several sub-...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Editorial Office of Computer Engineering
2020-04-01
|
| Series: | Jisuanji gongcheng |
| Assuntos: | |
| Acceso en liña: | https://www.ecice06.com/fileup/1000-3428/PDF/20200408.pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|