arXiv (All)
open access
An Empirical Evaluation of BMSSP and Dijkstra's Algorithm for the Lightning Network
Efficient routing is critical for payment channel networks (PCNs) such as the Lightning Network (LN), where shortest-path computations are commonly performed using Dijkstra-based algorithms. Recent theoretical work introduced the Bounded Multi-Source Shortest Path (BMSSP) algorithm, which achieves a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Continuous Spiking Graph Neural Networks#1035261
- On Limitations of Uniplex Networks for Modeling Multiplex Contagion#419369
- CacheDyG: Decoupling Temporal Propagation for Efficient Dynamic Graph Learning#1061442
- Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms#998512
- Usage and Applicability of BGP MPLS-Based Ethernet VPN#139240
Record · ID 1013442
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive