Login / Signup

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time.

Ei AndoToshio NakataMasafumi Yamashita
Published in: J. Discrete Algorithms (2009)
Keyphrases