| 000 | 00699nam a2200241 a 4500 | ||
|---|---|---|---|
| 001 | 27675 | ||
| 003 | BD-DhUET | ||
| 008 | 080219s2008 enka b 001 0 eng | ||
| 020 | _a9780521878647 | ||
| 020 | _a0521878640 | ||
| 040 |
_aDLC _cDLC _dBD-DhUET |
||
| 082 | 0 | 0 |
_a511.5 _bNAG/2008 |
| 100 | _aNagamochi, Hiroshi | ||
| 245 | 1 | 0 | _aAlgorithmic aspects of graph connectivity |
| 250 | _a1st ed. | ||
| 260 |
_aCambridge _aNew York _bCambridge University Press _c2008 |
||
| 300 |
_axv, 375 p. _bill. _c25 cm. |
||
| 490 | 1 | _aEncyclopedia of mathematics and its applications 123 | |
| 504 | _aIncludes bibliographies | ||
| 650 | 0 | _aGraph Connectivity | |
| 700 | _aIbaraki, Toshihide | ||
| 942 | _cGB | ||
| 999 |
_c27675 _d27675 |
||