Algorithmic graph theory / Alan Gibbons.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Contents:
1. 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
Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
Central Library, Sikkim University | 511.5 GIB/A (Browse shelf(Opens below)) | Available | 46731 |
Total holds: 0
1. 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
There are no comments on this title.