Graphs, networks, and algorithms / Dieter Jungnickel.
Language: English Original language: German Series: Algorithms and computation in mathematics ; 5Publication details: New York: Springer-Verlag, 2013.Edition: Fourth editionDescription: xx, 675 pages : illustrations ; 24 cmISBN:- 9783642436642 (Pbk)
- Graphen, Netzwerke und Algorithmen. English
- 23 511.5 J95G4
- QA402.5 .J8913 2013
| Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Books
|
Central Library, IISER Bhopal General Section | 511.5 J95G4 (Browse shelf(Opens below)) | Available | 12215 | ||||
|
Books
|
Central Library, IISER Bhopal On Display | Reference | 511.5 J95G4 (Browse shelf(Opens below)) | Not For Loan | Title recommended by Dr Ankur Raina | 12214 | ||
|
Books
|
Central Library, IISER Bhopal General Section | 511.5 J95G4 (Browse shelf(Opens below)) | Available | 12216 |
Browsing Central Library, IISER Bhopal shelves, Shelving location: General Section Close shelf browser (Hides shelf browser)
| 511.5 D44G Graph theory with applications to engineering and computer science | 511.5 EL59G Graphs on Surfaces : | 511.5 J95G4 Graphs, networks, and algorithms / | 511.5 J95G4 Graphs, networks, and algorithms / | 511.5 P66I Introduction to graph theory | 511.5 P66I Introduction to graph theory | 511.5 W52I2 Introduction to graph theory |
Earlier editions published in 1998, 2004, and 2008.
Includes bibliographical references (pages 629-659) and index.
1. Basic graph theory -- 2. Algorithms and complexity -- 3. Shortest paths -- 4. Spanning trees -- 5. The greedy algorithm -- 6. Flows -- 7. Combinatorial applications -- 8. Connectivity and depth first search -- 9. Colorings -- 10. Circulations -- 11. The network simplex algorithm -- 12. Synthesis of networks -- 13. Matchings -- 14. Weighted matchings -- 15. A hard problem: the TSP -- Appendix A. Some NP-complete problems -- Appendix B. Solutions -- Appendix C. List of symbols.
There are no comments on this title.