Giovanni Guarnieri Soares

Giovanni Guarnieri Soares

Auto-generated profile, based on publicly available information

Giovanni Guarnieri Soares

Postgraduate Program in Applied Computing ‐ CAP National Institute for Space Research (INPE) São José dos Campos São Paulo Brazil

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2022 in Transactions in GIS
Verified
Journal Article
Closed access
LTLívia Rodrigues Tomás
Lívia Rodrigues Tomás
GSGiovanni Guarnieri Soares
Giovanni Guarnieri Soares
AJAurelienne A. S. Jorge
Aurelienne A. S. Jorge
JMJeferson Feitosa Mendes
Jeferson Feitosa Mendes
VFVander L. S. Freitas
Vander L. S. Freitas
LSLeonardo Bacelar Lima Santos
Leonardo Bacelar Lima Santos

6 October 2022 in arXiv
Verified
Preprint
Open access
PDF file
LSLeonardo Bacelar Lima Santos
Leonardo Bacelar Lima Santos
LCLuiz Max Carvalho
Luiz Max Carvalho
GSGiovanni G. Soares
Giovanni G. Soares
Leonardo FerreiraLeonardo Ferreira
Leonardo Ferreira
ISIgor Sokolov
Igor Sokolov
The traditional complex network approach considers only the shortest paths from one node to another, not taking into account several other possible paths. This limitation is significant, for example, in urban mobility studies. In this short report, as the first steps, we present an exhaustive approach to address that problem and show we can go beyond the shortest path, but we do not need to go so far: we present an interactive procedure and an early stop possibility. After presenting some fundamental concepts in graph theory, we presented an analytical solution for the problem of counting the number of possible paths between two nodes in complete graphs, and a depth-limited approach to get all possible paths between each pair of nodes in a general graph (an NP-hard problem). We do not collapse the distribution of path lengths between a pair of nodes into a scalar number, we look at the distribution itself - taking all paths up to a pre-defined path length (considering a truncated distribution), and show the impact of that approach on the most straightforward distance-based graph index: the walk/path length.