Documents disponibles écrits par cet auteur

Graphs, algorithms, and optimization / William Kocay

Public ISBD Titre : Graphs, algorithms, and optimization Type de document : texte imprimé Auteurs : William Kocay, Auteur ; Donald L. Kreher, Auteur Editeur : Boca Raton [Etats-Unis] : Chapman & Hall / CRC Année de publication : 2005 Collection : Discrete mathematics and its applications Importance : 483 p. Présentation : ill. Format : 25 cm ISBN/ISSN/EAN : 978-1-584-88396-8 Note générale : Bibliogr p. 469-476. Index Langues : Anglais (eng) Mots-clés : Graphes,  Théorie  des Optimisation  mathématique Graph  algorithms Index. décimale : 519.17 Théorie des graphes Résumé : A valuable resource for mathematics and computer science students, Graphs, Algorithms and Optimization presents the theory of graphs from an algorithmic viewpoint. The authors cover the key topics in graph theory and introduce discrete optimization and its connection to graph theory. The book contains a wealth of information on algorithms and the data structures needed to program them efficiently. Many programming techniques used for algorithms, algorithmic complexity and efficiency, a chapter on NP-completeness and three chapters on linear optimization are also included. The graph theory presented is rigorous, but the style is informal. Note de contenu : * Graphs and Their Complements. * Paths and Walks. Some Special Classes of Graphs. * Trees and Cycles. The Structure of Trees. * Connectivity. Matchings. Network Flows. * Hamilton Cycles. ... Graphs, algorithms, and optimization [texte imprimé] / William Kocay, Auteur ; Donald L. Kreher, Auteur . - Chapman & Hall / CRC, 2005 . - 483 p. : ill. ; 25 cm. - (Discrete mathematics and its applications) . ISBN : 978-1-584-88396-8 Bibliogr p. 469-476. Index Langues : Anglais (eng) Mots-clés : Graphes,  Théorie  des Optimisation  mathématique Graph  algorithms Index. décimale : 519.17 Théorie des graphes Résumé : A valuable resource for mathematics and computer science students, Graphs, Algorithms and Optimization presents the theory of graphs from an algorithmic viewpoint. The authors cover the key topics in graph theory and introduce discrete optimization and its connection to graph theory. The book contains a wealth of information on algorithms and the data structures needed to program them efficiently. Many programming techniques used for algorithms, algorithmic complexity and efficiency, a chapter on NP-completeness and three chapters on linear optimization are also included. The graph theory presented is rigorous, but the style is informal. Note de contenu : * Graphs and Their Complements. * Paths and Walks. Some Special Classes of Graphs. * Trees and Cycles. The Structure of Trees. * Connectivity. Matchings. Network Flows. * Hamilton Cycles. ...

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Etat_Exemplaire
049707	519.17 KOC	Papier	Bibliothèque Centrale	Mathématiques	Disponible	En bon état