Graphs, algorithns, and optimization / William L. Locay, Donald L. Kreher.
Material type:
TextSeries: Publisher: Boca Raton, FL. : CRC Press / Taylor & Francis Group, c2017Edition: Second editionDescription: xix, 545 pages : illustrations ; 24 cmContent type: - text
- unmediated
- volume
- QA 166.245 .K81 2017
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Graduate Studies
|
DLSU-D GRADUATE STUDIES Graduate Studies | QA 166.245 .K81 2017 (Browse shelf(Opens below)) | Available | 3CIR201766132 |
"A Chapman & Hall book."
Includes bibliographical references (pages 527-537) and index
Graphs and their complements -- Paths and walks -- Subgraphs -- Some special classes of graphs -- Trees and cycles -- The structure of trees -- Connectivity -- Graphs and symmetry -- Alternating paths and matchings -- Network flows -- Hamilton cycles -- Digraphs -- Graph colorings -- Planar graphs -- Graphs and surfaces -- The Klein Bottle and Double Torus -- Linear programming -- The primal-dual algorithm -- Discrete linear programming.
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 is a rich source of problems and techniques for programming and data structre development, as well as for the theory of computing, including NP- completeness and polynomial reduction. This second edition could be used as a textbook for a third or fourth year course on graph algorithms which contains a programming content, or for a more advanced course at the fourth year or graduate level. It could be used in a course in which the programming language is any major language (e.g., C, C++, Java). The algorithms are presented in a generic style and are not dependent on any particular programming language.
There are no comments on this title.
