dc.contributor | Universidade de São Paulo (USP) | |
dc.contributor | Universidade Federal de Mato Grosso do Sul (UFMS) | |
dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2019-10-04T12:35:15Z | |
dc.date.accessioned | 2022-12-19T18:06:37Z | |
dc.date.available | 2019-10-04T12:35:15Z | |
dc.date.available | 2022-12-19T18:06:37Z | |
dc.date.created | 2019-10-04T12:35:15Z | |
dc.date.issued | 2019-01-01 | |
dc.identifier | Journal Of Computational Science. Amsterdam: Elsevier Science Bv, v. 30, p. 209-222, 2019. | |
dc.identifier | 1877-7503 | |
dc.identifier | http://hdl.handle.net/11449/185410 | |
dc.identifier | 10.1016/j.jocs.2018.12.015 | |
dc.identifier | WOS:000457951200019 | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/5366462 | |
dc.description.abstract | We propose an algebraic tool-set and related algorithms to track access problems not obviously observed in urban environments represented as street mashes. Our tool-set assumes that points of interest must be promptly accessible within the paths of a street network. Over that assumption, we introduce formalisms and computational tools to detect and evaluate access-related problems. The output of our methods, in the form of inconsistent nodes found in a given city, has the potential to assist the decision-making process regarding the positioning of resources, building of new services, and outlining the initial design of a city. (C) 2018 Elsevier B.V. All rights reserved. | |
dc.language | eng | |
dc.publisher | Elsevier B.V. | |
dc.relation | Journal Of Computational Science | |
dc.rights | Acesso aberto | |
dc.source | Web of Science | |
dc.subject | Complex network | |
dc.subject | Network analysis | |
dc.subject | Urban structure | |
dc.title | Detecting multi-scale distance-based inconsistencies in cities through complex-networks | |
dc.type | Artículos de revistas | |