Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
None
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2011
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/12929 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
- Efficiently Finding a Maximal Clique Summary via Effective Sampling
- Finding Maximum Cliques in Large Networks
- Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk
- A spectral algorithm for finding maximum cliques in dense random intersection graphs
- Finding a Maximum Clique in a Disk Graph
- Finding a Maximum Clique in a Grounded 1-Bend String Graph