On some conditioning results in the probabilistic analysis of algorithms |
| |
Authors: | Colin McDiarmid |
| |
Affiliation: | Institute of Economics and Statistics, Oxford, U.K. |
| |
Abstract: | A simple combinatorial approach is given for handling certain conditioning problems that arise in the probabilistic analysis of graph algorithms. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|