| 000 | 00848nam a22002657a 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20221101122752.0 | ||
| 008 | 221101b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9780511721649 | ||
| 100 |
_aNagamochi, Hiroshi _eAuthor |
||
| 245 |
_aAlgorithmic aspects of graph connectivity _cby Hiroshi Nagamochi and Toshihide Ibaraki |
||
| 260 |
_bCambridge university press _c2010 |
||
| 440 | _aEncyclopedia of mathematics and its applications; no. 123 | ||
| 653 | _aMathematics (general) | ||
| 653 | _aComplexity | ||
| 653 | _aAlgorithmics | ||
| 653 | _aComputer Algebra | ||
| 653 | _aComputational Geometry | ||
| 653 | _aComputer Science | ||
| 653 | _aOptimization | ||
| 653 | _aStatistics and Probability | ||
| 700 |
_aIbaraki, Toshihide _eAuthor |
||
| 856 | _uhttps://doi.org/10.1017/CBO9780511721649 | ||
| 942 |
_2ddc _cEB |
||
| 999 |
_c25641 _d25641 |
||