Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Designing Efficient and Reachable Routes: The -Step-Central Shortest Path Problem
Johnson Phosavanh, Dmytro Matsypura
Designing rapid transportation routes requires balancing efficiency and reachability. Shortest-path models ensure direct, cost-efficient routes but ignore coverage, while centralit…
cs.DS2024
Centrality of shortest paths: Algorithms and complexity results
Johnson Phosavanh, Dmytro Matsypura
The degree centrality of a node, defined as the number of nodes adjacent to it, is often used as a measure of importance of a node to the structure of a network. This metric can be…