|
|||||
|
|
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time |
|
| Authors: | Ei Ando Toshio Nakata Masafumi Yamashita |
| Institution: | aDept. Computer Sci. and Communication Eng., Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395, Japan;bDept. of Mathematics, Fukuoka University of Education, Akama-Bunkyomachi, Munakata, Fukuoka, 811-4192, Japan;cInstitute of Systems, Information Technologies and Nanotechnologies, Fukuoka SRP Center Building 7F 2-1-22, Momochihama, Sawara-ku, Fukuoka, 814-0001, Japan |
| Abstract: | |
| Keywords: | Directed acyclic graph Longest path problem Stochastic edge weight Normal distribution Approximation |
| 本文献已被 ScienceDirect 等数据库收录！ | |