| 000 | 01672cam a2200373Ii 4500 | ||
|---|---|---|---|
| 001 | CAH00CE5955PDF | ||
| 003 | FlBoTFG | ||
| 005 | 20230515114657.0 | ||
| 006 | m o d | ||
| 007 | cr cn | ||
| 008 | 151218t20162016flua ob 001 0 eng d | ||
| 020 | _a9780429150234 | ||
| 035 | _a(OCoLC)930992656 | ||
| 040 |
_aFlBoTFG _beng _erda _cFlBoTFG |
||
| 082 |
_a511 _bH236 |
||
| 090 |
_aQA166 _b.H364 2016 |
||
| 100 | _aThulasiraman, Krishnaiyan "KT" ... [ et al.] | ||
| 245 | 0 | 0 | _aHandbook of Graph Theory, Combinatorial Optimization, and Algorithms |
| 260 |
_aBoca Raton : _bCRC Press, _cc2016. |
||
| 300 |
_a1244 p. : _b345 B/W ill. |
||
| 490 | 1 | _aChapman & Hall/CRC computer and information science series | |
| 500 | _aA Chapman & Hall book. | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | _asection 1. Basic concepts and algorithms -- section 2. Flows in networks -- section 3. Algebraic graph theory -- section 4. Structural graph theory -- section 5. Planar graphs -- section 6. Interconnection networks -- section 7. Special graphs -- section 8. Partitioning -- section 9. Matroids -- section 10. Probabilistic methods, random graph models, and randomized algorithms -- section 11. Coping with NP-completeness. | |
| 530 | _aAlso available in print format. | ||
| 650 | 0 | _aGraph theory. | |
| 650 | 0 | _aCombinatorial optimization. | |
| 650 | 0 | _aAlgorithms. | |
| 655 | 7 |
_aElectronic books. _2lcsh |
|
| 776 | 0 | 8 |
_iPrint version: _z9781584885955 (hardback) |
| 830 | 0 | _aChapman & Hall/CRC computer and information science series. | |
| 856 | 4 | 0 |
_uhttp://marc.crcnetbase.com/isbn/9781420011074 _qebook |
| 942 |
_2ddc _cEBK |
||
| 999 |
_c996 _d996 |
||