| Titre : |
Graphs, Algorithms, and Optimization 2éd |
| Type de document : |
texte imprimé |
| Auteurs : |
L. Kocay William, Auteur ; Donald L. Kreher, Auteur |
| Mention d'édition : |
2éd |
| Editeur : |
CRC Press Taylor Francis Group |
| Année de publication : |
2017 |
| Importance : |
545 p |
| Format : |
23.5x15.5 cm |
| ISBN/ISSN/EAN : |
978-1-03-247715-2 |
| Langues : |
Français (fre) Langues originales : Français (fre) |
| Mots-clés : |
Graphs,
Algorithms |
| Index. décimale : |
518 |
| 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 2éd [texte imprimé] / L. Kocay William, Auteur ; Donald L. Kreher, Auteur . - 2éd . - France : CRC Press Taylor Francis Group, 2017 . - 545 p ; 23.5x15.5 cm. ISBN : 978-1-03-247715-2 Langues : Français ( fre) Langues originales : Français ( fre)
| Mots-clés : |
Graphs,
Algorithms |
| Index. décimale : |
518 |
| 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
