×

zbMATH — the first resource for mathematics

Comments on the analysis of parameters in a random graph model. (English) Zbl 0834.68091
Summary: Using generating functions and classical identities due to Euler and Gauss we can extend and simplify some of the results of F. Afrati and A. Stafylopatis [Performance considerations on a random graph model for parallel processing, RAIRO, Inform. Theor. Appl. 27, No. 4, 367-388 (1993; Zbl 0778.68017)].
MSC:
68R10 Graph theory (including graph drawing) in computer science
68W10 Parallel algorithms in computer science
PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] 1. F. AFRATI and A. STAFYLOPATIS, Performance Considérations on a Random Graph Model for Parallel Processing, RAIRO Theoretical Informatics and Applications, 1993, 27, pp. 367-388. Zbl0778.68017 MR1238057 · Zbl 0778.68017 · eudml:92457
[2] 2. G. E. ANDREWS, The Theory of Partitions, Addison-Wesley, Reading, MA, 1976. Zbl0371.10001 MR557013 · Zbl 0371.10001
[3] 3. P. FLAJOLET and A. ODLYZKO, Singularity Analysis of Generating Functions, SIAM J. Discrete Mathematics, 1990, 3, pp. 216-240. Zbl0712.05004 MR1039294 · Zbl 0712.05004 · doi:10.1137/0403019
[4] 4. P. FLAJOLET and J. VITTER, Analysis of Algorithms and Data Structures, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity. (J. van Leeuwen, ed.), 1990, pp. 431-524. Zbl0900.68251 MR1127175 · Zbl 0900.68251
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.