A carregar...
How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2(n)), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the num...
Na minha lista:
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
The Royal Society Publishing
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4156142/ https://ncbi.nlm.nih.gov/pubmed/25294962 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rspa.2014.0224 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|