On depth first search strees inm-out digraphs |
| |
Authors: | W C Stephen Suen |
| |
Institution: | (1) Department of Mathematics, Carnegie Mellon University, 15213 Pittsburg, PA, U.S.A. |
| |
Abstract: | We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let
i
be thei
th vertex encountered by DFS andL(i, m, n) be the height of
i
in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree. |
| |
Keywords: | 05 C 20 68 R 10 |
本文献已被 SpringerLink 等数据库收录! |
|