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 contai
Graphs, algorithms and optimization
โ Scribed by Kocay, William;Kreher, Donald L
- Publisher
- Chapman & Hall;CRC
- Year
- 2016
- Tongue
- English
- Leaves
- 566
- Series
- Discrete mathematics and its applications
- Edition
- 2nd ed
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Preface; 1 Graphs and Their Complements; 2 Paths and Walks; 3 Subgraphs; 4 Some Special Classes of Graphs; 5 Trees and Cycles; 6 The Structure of Trees; 7 Connectivity; 8 Graphs and Symmetry; 9 Alternating Paths and Matchings; 10 Network Flows; 11 Hamilton Cycles; 12 Digraphs; 13 Graph Colorings; 14 Planar Graphs; 15 Graphs and Surfaces; 16 The Klein Bottle and the Double Torus; 17 Linear Programming; 18 The Primal-Dual Algorithm; 19 Discrete Linear Programming; Bibliography; Index
;A valuable resource for mathematics and computer science students, this text presents the theory of graphs from an algorithmic viewpoint. It contains a wealth of information on algorithms and the data structures needed to program them efficiently.
โฆ Table of Contents
<
P>
Preface
1 Graphs and Their Complements
2 Paths and Walks
3 Subgraphs
4 Some Special Classes of Graphs
5 Trees and Cycles
6 The Structure of Trees
7 Connectivity
8 Graphs and Symmetry
9 Alternating Paths and Matchings
10 Network Flows
11 Hamilton Cycles
12 Digraphs
13 Graph Colorings
14 Planar Graphs
15 Graphs and Surfaces
16 The Klein Bottle and the Double Torus
17 Linear Programming
18 The Primal-Dual Algorithm
19 Discrete Linear Programming
Bibliography
Index <
/p>
<
p>
โฆ Subjects
Graph algorithms;Mathematical optimization
๐ SIMILAR VOLUMES
CRC Press, 2005. โ 305 p.<div class="bb-sep"></div>Our objective in writing this book is to present the theory of graphs from an algorithmic viewpoint. We 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 pr
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
<P>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
<P>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