000 | 01013pam a2200277 a 4500 | ||
---|---|---|---|
999 |
_c195369 _d195369 |
||
020 | _a9780521288811 | ||
040 | _cCUS | ||
082 | 0 | 0 |
_a511.5 _bGIB/A |
100 | 1 | _aGibbons, Alan | |
245 | 1 | 0 |
_aAlgorithmic graph theory / _cAlan Gibbons. |
260 |
_aCambridge [Cambridgeshire] ; _aNew York : _bCambridge University Press, _c1985. |
||
300 |
_axii, 259 p. ; _c24 cm. |
||
505 | _a1. Introducing graphs and algorithmic complexity; 2. Spanning-trees, branchings and connectivity; 3. Planar graphs; 4. Networks and flows; 5. Matchings; 6. Eulerian and Hamiltonian tours; 7. Colouring graphs; 8. Graph problems and intractability | ||
650 | 0 | _aGraph theory. | |
650 | 0 |
_aGraph theory _xData processing. |
|
942 | _cWB16 |