π
π
The Cartographer
Verifying Shortest Paths in Linear Time
December 09, 2024 Β· Declared Dead Β· π 2024 12th International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC)
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ahmed Shokry, Amr Elmasry, Ayman Khalafallah, Amr Aly
arXiv ID
2412.06121
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
2024 12th International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC)
Last Checked
5 months ago
Abstract
In this paper we propose a linear-time certifying algorithm for the single-source shortest-path problem capable of verifying graphs with positive, negative, and zero arc weights. Previously proposed linear-time approaches only work for graphs with positive arc weights.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted