Graphs, Networks and Algorithms

From the reviews of the previous editions ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Jungnickel, Dieter (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Έκδοση:4th ed. 2013.
Σειρά:Algorithms and Computation in Mathematics, 5
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Prefaces
  • Basic Graph Theory
  • Algorithms and Complexity
  • Shortest Paths
  • Spanning Trees
  • The Greedy Algorithm
  • Flows
  • Combinatorial Applications
  • Connectivity and Depth First Search
  • Colorings
  • Circulations
  • The Network Simplex Algorithm
  • Synthesis of Networks
  • Matchings
  • Weighted Matchings
  • A Hard Problem: The TSP
  • Appendix A: Some NP-Complete Problems
  • Appendix B: Solutions
  • Appendix C: List of Symbols
  • References
  • Index.