dc.contributorUniversidade de São Paulo (USP)
dc.contributorUniversidade Federal de Mato Grosso do Sul (UFMS)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2019-10-04T12:35:15Z
dc.date.accessioned2022-12-19T18:06:37Z
dc.date.available2019-10-04T12:35:15Z
dc.date.available2022-12-19T18:06:37Z
dc.date.created2019-10-04T12:35:15Z
dc.date.issued2019-01-01
dc.identifierJournal Of Computational Science. Amsterdam: Elsevier Science Bv, v. 30, p. 209-222, 2019.
dc.identifier1877-7503
dc.identifierhttp://hdl.handle.net/11449/185410
dc.identifier10.1016/j.jocs.2018.12.015
dc.identifierWOS:000457951200019
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5366462
dc.description.abstractWe 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.languageeng
dc.publisherElsevier B.V.
dc.relationJournal Of Computational Science
dc.rightsAcesso aberto
dc.sourceWeb of Science
dc.subjectComplex network
dc.subjectNetwork analysis
dc.subjectUrban structure
dc.titleDetecting multi-scale distance-based inconsistencies in cities through complex-networks
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución