Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
The Royal Society Publishing
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4156142/ https://www.ncbi.nlm.nih.gov/pubmed/25294962 http://dx.doi.org/10.1098/rspa.2014.0224 |