Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
From MaRDI portal
Publication:3630194
DOI10.1007/978-3-642-02017-9_13zbMath1241.05139OpenAlexW1486749018MaRDI QIDQ3630194
Hirotaka Ono, Ei Ando, Kunihiko Sadakane, Masafumi Yamashita
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_13
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG