A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs

v1

Type:Journal Article

0 views

[![NobleID](https://www.nobleid.org/api/badge/3FF7AF8B.svg?ark=w1%2F20260515%2F3FF7AF8B)](https://nobleid.org/work/w1/20260515/3FF7AF8B)

ARK Inflections

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors