Graphes et algorithmes / Michel Gondran, Michel Minoux

Auteur: Gondran, Michel - AuteurCo-auteur: Minoux, Michel - AuteurType de document: Monographie Collection: Collection EDF R et D Langue: françaisPays: FranceÉditeur: Paris : Edition Tec et Doc, 2009Edition: 4e édition revue et augmentéeDescription: 1 vol. (XXXI-784 p.) : ill., fig., couv. ill. en coul. ; 25 cm ISBN: 9782743010355 ; rel. Note: The authors present theory and applications of graph theory in twelve chapters: basic concepts, shortest paths, the algebra of paths, trees and arborescences, flows and transportation networks, flows in networks with gains and multi-commodity network flows, matchings and b-matchings, Eulerian and Hamiltonian tours, matroids, difficult problems within the class NP, implicit enumeration and approximate algorithms, followed by five appendices on linear (integer) programming, Lagrangean relaxation, dynamic and fractional programming. This 4th edition takes account of recent developments not only by an updated bibliography and an improved overall presentation. Biology-inspired approximate algorithms such as genetic and ant colony algorithms are included, and (iterative) randomized greedy algorithms are treated in detail. With one hundred applications modelled and over two hundred exercises of different levels this textbook continues to be one of the basic references in algorithmic graph theory. (Zentralblatt)Bibliographie: Bibliogr. en fin de chapitres. Index. Sujets MSC: 05C85 Combinatorics -- Graph theory -- Graph algorithms
05-01 Combinatorics -- Instructional exposition (textbooks, tutorial papers, etc.)
68-01 Computer science -- Instructional exposition (textbooks, tutorial papers, etc.)
90-01 Operations research, mathematical programming -- Instructional exposition (textbooks, tutorial papers, etc.)
90C10 Operations research, mathematical programming -- Mathematical programming -- Integer programming
Location Call Number Status Date Due
Salle R 07410-01 / 05 GON (Browse Shelf) Available

The authors present theory and applications of graph theory in twelve chapters: basic concepts, shortest paths, the algebra of paths, trees and arborescences, flows and transportation networks, flows in networks with gains and multi-commodity network flows, matchings and b-matchings, Eulerian and Hamiltonian tours, matroids, difficult problems within the class NP, implicit enumeration and approximate algorithms, followed by five appendices on linear (integer) programming, Lagrangean relaxation, dynamic and fractional programming. This 4th edition takes account of recent developments not only by an updated bibliography and an improved overall presentation. Biology-inspired approximate algorithms such as genetic and ant colony algorithms are included, and (iterative) randomized greedy algorithms are treated in detail. With one hundred applications modelled and over two hundred exercises of different levels this textbook continues to be one of the basic references in algorithmic graph theory. (Zentralblatt)

Bibliogr. en fin de chapitres. Index

There are no comments for this item.

Log in to your account to post a comment.
Languages: English | Français | |