Caricamento...
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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
The Royal Society Publishing
2014
|
| Soggetti: | |
| Accesso online: | 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: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|