| 000 | 00866nam a2200313Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20220912144025.0 | ||
| 006 | a|||||r|||| 00| 0 | ||
| 007 | ta | ||
| 008 | 220909b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9781107076266 (hbk) | ||
| 024 | _a198974 | ||
| 037 | _cTextual | ||
| 040 | _beng | ||
| 041 | _aeng | ||
| 082 | _aD65,8(B):71, Q6 | ||
| 100 | _aBarabasi Albert-Laszlo | ||
| 245 | 0 | _aNetwork science | |
| 260 |
_aCambridge _bCambridge University Press _c2016 |
||
| 300 |
_axviii, 456p. ill. col. _ccm |
||
| 500 | _aReferences 436-452p.; Index 453-456p. | ||
| 650 | _a Degree correlation | ||
| 650 | _a Graph theory | ||
| 650 | _a Network robustness | ||
| 650 | _a Random networks | ||
| 650 | _aComputer science | ||
| 942 |
_hD65,8(B):71, Q6 _cTEXL _2CC |
||
| 999 |
_c1139 _d1139 |
||