Cargando…
The simplicity of planar networks
Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and non local information about the spatial orga...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3861802/ https://www.ncbi.nlm.nih.gov/pubmed/24336510 http://dx.doi.org/10.1038/srep03495 |