Graphs, Networks and AlgorithmsSpringer Science & Business Media, 2005 - 611 páginas From the reviews of the first edition: ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced. |
Contenido
III | 1 |
IV | 2 |
V | 5 |
VI | 13 |
VII | 14 |
VIII | 21 |
IX | 25 |
X | 28 |
LXIX | 266 |
LXX | 271 |
LXXI | 274 |
LXXII | 281 |
LXXIII | 286 |
LXXIV | 290 |
LXXV | 293 |
LXXVI | 306 |
XI | 33 |
XII | 34 |
XIII | 36 |
XIV | 39 |
XV | 41 |
XVI | 43 |
XVII | 46 |
XVIII | 49 |
XIX | 53 |
XX | 59 |
XXII | 61 |
XXIII | 63 |
XXIV | 68 |
XXV | 71 |
XXVI | 75 |
XXVII | 79 |
XXVIII | 82 |
XXIX | 87 |
XXX | 95 |
XXXII | 97 |
XXXIII | 101 |
XXXIV | 104 |
XXXV | 110 |
XXXVI | 116 |
XXXVII | 118 |
XXXVIII | 123 |
XL | 125 |
XLI | 130 |
XLII | 132 |
XLIII | 139 |
XLIV | 143 |
XLV | 147 |
XLVI | 153 |
XLVII | 162 |
XLVIII | 169 |
XLIX | 179 |
L | 182 |
LI | 201 |
LIII | 205 |
LIV | 209 |
LV | 215 |
LVI | 219 |
LVII | 223 |
LVIII | 226 |
LIX | 231 |
LX | 234 |
LXI | 238 |
LXII | 244 |
LXIII | 246 |
LXIV | 250 |
LXV | 253 |
LXVI | 256 |
LXVII | 259 |
LXVIII | 262 |
LXXVII | 313 |
LXXVIII | 318 |
LXXIX | 321 |
LXXX | 322 |
LXXXI | 324 |
LXXXII | 327 |
LXXXIII | 331 |
LXXXIV | 336 |
LXXXV | 341 |
LXXXVI | 344 |
LXXXVII | 351 |
LXXXVIII | 357 |
LXXXIX | 361 |
XC | 367 |
XCI | 371 |
XCII | 374 |
XCIII | 380 |
XCIV | 396 |
XCV | 399 |
XCVI | 400 |
XCVII | 401 |
XCVIII | 410 |
XCIX | 414 |
C | 418 |
CI | 422 |
CII | 430 |
CIII | 433 |
CIV | 436 |
CV | 441 |
CVI | 446 |
CVII | 453 |
CVIII | 455 |
CIX | 459 |
CX | 464 |
CXI | 472 |
CXII | 475 |
CXIII | 483 |
CXIV | 489 |
CXV | 493 |
CXVI | 500 |
CXVII | 504 |
CXVIII | 507 |
CXIX | 516 |
CXX | 523 |
CXXI | 530 |
CXXIII | 538 |
CXXV | 544 |
CXXVI | 548 |
CXXVII | 554 |
CXXVIII | 557 |
CXXX | 559 |
565 | |
597 | |
Otras ediciones - Ver todas
Términos y frases comunes
1-factor acyclic adjacent admissible arbitrary assume augmenting path auxiliary network backward edge bipartite graph called capacity Chapter choose color complete graph complexity condition connected components connected graph consider constructed Corollary corresponding cost function cycles of negative defined denote determining digraph digraph G directed cycle edge of G end vertex entries Euler tour Example Exercise exists feasible circulation flow network G contains given graph G graph theory greedy algorithm Hamiltonian cycle Hence independent set induction inequality integer iteration labelled Lemma Let G Math matrix matroid maximal flow minimal spanning tree minimal weight Moreover multigraph negative length nonnegative Note NP-complete optimal solution orientation perfect matching planar graph polynomial algorithm problem procedure proof of Theorem PUSH-operations respect s-tree satisfies Section shortest path shown in Figure simplex algorithm solved Steiner tree step subgraph subset suppose Tarjan V₁ vertex set vertices of G weight function yields