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). 论文

2001Bulletin of the London Mathematical Society引用 323

Complexity and Algorithms in GraphsAlgorithms and Data Compression

Algorithms and Data Compression Complexity and Algorithms in Graphs

相关技术:Algorithms and Data Compression Complexity and Algorithms in Graphs

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). · 相关文章

暂无数据