"Approximating the longest path length of a stochastic DAG by a normal ..."

Ei Ando, Toshio Nakata, Masafumi Yamashita (2009)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2009.01.001

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/AndoNY09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/AndoNY09
Ei Ando, Toshio Nakata, Masafumi Yamashita:
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. J. Discrete Algorithms 7(4): 420-438 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.