Publication | Closed Access
RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) <i>By</i> S<scp>VANTE</scp> J<scp>ANSON</scp>, T<scp>OMASZ</scp> Ł<scp>UCZAK</scp> and A<scp>NDRZEJ</scp> R<scp>UCIŃSKI</scp>: 333 pp., US$48.50, <scp>ISBN</scp> 0-471-17541-2 (John Wiley & Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) <i>By</i> V. F. K<scp>OLCHIN</scp>: 252 pp., US$50, <scp>ISBN</scp> 0-521-44081-5 (Cambridge University Press, 1999).
313
Citations
0
References
2001
Year
Network ScienceGraph TheoryEngineeringRandom GraphStructural Graph TheoryExtremal Graph TheoryProbabilistic Graph TheoryWiley Interscience SeriesNetwork AnalysisEducationRandom GraphsProbability TheoryNew YorkDiscrete MathematicsCombinatorial OptimizationGraph Algorithm
RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) By SVANTE JANSON, TOMASZ ŁUCZAK and ANDRZEJ RUCIŃSKI: 333 pp., US$48.50, ISBN 0-471-17541-2 (John Wiley & Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) By V. F. KOLCHIN: 252 pp., US$50, ISBN 0-521-44081-5 (Cambridge University Press, 1999). - Volume 33 Issue 3