1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
Ei Ando
This paper is about the length XMAX of the longest path in directed acyclic graph (DAG) G=(V,E) with random edge lengths, where ∣V∣=n and ∣E∣=m. When the edge length…