Fast-Marching Methods for Curvature Penalized Shortest Paths
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Mathematical Imaging and Vision"
DOI: 10.1007/s10851-017-0778-5
Abstract: We introduce numerical schemes for computing distances and shortest paths with respect to several planar paths models, featuring curvature penalization and data-driven velocity: the Dubins car, the Euler/Mumford elastica, and a two variants of the… read more here.
Keywords: fast marching; marching methods; curvature penalized; methods curvature ... See more keywords
Shortest Paths in Multiplex Networks
Sign Up to like & getrecommendations! Published in 2017 at "Scientific Reports"
DOI: 10.1038/s41598-017-01655-x
Abstract: The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These… read more here.
Keywords: shortest paths; paths multiplex; multiplex networks;
Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding
Sign Up to like & getrecommendations! Published in 2019 at "Numerical Functional Analysis and Optimization"
DOI: 10.1080/01630563.2019.1566927
Abstract: Abstract We present an efficient algorithm for finding the shortest path joining two points in a sequence of triangles in three-dimensional space using the concept of funnels associated with common edges along the sequence of… read more here.
Keywords: finding shortest; triangles planar; sequence triangles; shortest paths ... See more keywords
Network approach to mutagenesis sheds insight on phage resistance in mycobacteria
Sign Up to like & getrecommendations! Published in 2021 at "Bioinformatics"
DOI: 10.1093/bioinformatics/btaa1103
Abstract: MOTIVATION A rigorous yet general mathematical approach to mutagenesis, especially one capable of delivering systems-level perspectives would be invaluable. Such systems-level understanding of phage resistance is also highly desirable for phage-bacteria interactions and phage therapy… read more here.
Keywords: network; phage; approach mutagenesis; shortest paths ... See more keywords
An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2915974
Abstract: Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In… read more here.
Keywords: uncertain graphs; centrality; centrality uncertain; shortest paths ... See more keywords
On the Utilization of Shortest Paths in Complex Networks
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Access"
DOI: 10.1109/access.2021.3101176
Abstract: Considerable effort has been devoted to the study of network structures and connectivity patterns and their influence on network dynamics. A widely used assumption in network analysis models is that traffic follows the shortest paths… read more here.
Keywords: complex networks; paths complex; shortest paths; utilization shortest ... See more keywords
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Access"
DOI: 10.1109/access.2021.3131635
Abstract: A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed. It allows using all reserve shortest paths in the presence of destructive factors… read more here.
Keywords: shortest paths; networks chip; based circulant; topology ... See more keywords
Predicting resting-state functional connectivity with efficient structural connectivity
Sign Up to like & getrecommendations! Published in 2018 at "IEEE/CAA Journal of Automatica Sinica"
DOI: 10.1109/jas.2017.7510880
Abstract: The complex relationship between structural connectivity ( SC ) and functional connectivity ( FC ) of human brain networks is still a critical problem in neuroscience. In order to investigate the role of SC in… read more here.
Keywords: network; structural connectivity; model; dynamic model ... See more keywords
Efficient Parallel Processing of All-Pairs Shortest Paths on Multicore and GPU Systems
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Transactions on Consumer Electronics"
DOI: 10.1109/tce.2023.3327328
Abstract: Finding the shortest path between any two nodes in a graph, known as the All-Pairs Shortest Paths (APSP), is a fundamental problem in many data analysis problems, such as supply chains in logistics, routing protocols… read more here.
Keywords: efficient parallel; gpu systems; pairs shortest; shortest paths ... See more keywords
Finding Top-k Shortest Paths with Diversity
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2017.2773492
Abstract: The classical K Shortest Paths (KSP) problem, which identifies the $k$ shortest paths in a directed graph, plays an important role in many application domains, such as providing alternative paths for vehicle routing services. However,… read more here.
Keywords: alternatives inline; tex math; shortest paths; problem ... See more keywords
I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2024.3386906
Abstract: Shortest path computation is a basic operation for many graph-based applications and has been extensively studied. However, most existing works only consider the optimal path of a single criterion but ignore real-world situations involving multiple… read more here.
Keywords: multi criteria; partition; real world; shortest paths ... See more keywords