A Dijkstra-based Lightning Network routing algorithm is correct and polynomial for consistent (non-negative-rate) fee functions, and the routing problem is NP-hard for arbitrary fee functions.
High throughput cryptocur- 22 An Analysis of the Correctness and Computational Complexity rency routing in payment channel networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks
A Dijkstra-based Lightning Network routing algorithm is correct and polynomial for consistent (non-negative-rate) fee functions, and the routing problem is NP-hard for arbitrary fee functions.