| Titre : |
Graphs, Algorithms, and Optimization 2ed |
| Type de document : |
texte imprimé |
| Auteurs : |
William L. Kocay, Auteur ; Donald L.Kreher, Auteur |
| Mention d'édition : |
2 éd |
| Editeur : |
Taylor & Francis Ltd |
| Année de publication : |
2022 |
| Importance : |
545 p |
| Format : |
23.5x15.5 cm |
| ISBN/ISSN/EAN : |
978-1-03-247715-2 |
| Langues : |
Français (fre) |
| Mots-clés : |
Graphs, Algorithms, and Optimizatio |
| Résumé : |
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. |
Graphs, Algorithms, and Optimization 2ed [texte imprimé] / William L. Kocay, Auteur ; Donald L.Kreher, Auteur . - 2 éd . - [S.l.] : Taylor & Francis Ltd, 2022 . - 545 p ; 23.5x15.5 cm. ISBN : 978-1-03-247715-2 Langues : Français ( fre)
| Mots-clés : |
Graphs, Algorithms, and Optimizatio |
| Résumé : |
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. |
|  |
Affiner la recherche Interroger des sources externes
