What people are saying - Write a review
We haven't found any reviews in the usual places.
Preface Chapter 1 Introduction 1 GraphsDefinition
Paths and Chains
Loops Circuits and Cycles
92 other sections not shown
algorithm of Section alternating tree arc xf assignment problem augmenting chain augmenting path backtracking bipartite graph blossom calculated Chapter colouring column complete graph computation considered corresponding cost matrix cut-set decision-tree search defined Eulerian circuit example find the shortest flow pattern fundamental circuits given goto step graph G graph of Fig graph shown graph theory Hamiltonian circuit hence initial iteration labels links of G lower bound maximal independent set maximum flow maximum flow problem median method minimal minimum cost flow negative cost circuits node nondirected graph number of vertices optimal p-centre p-median problem of finding pseudo-vertex reachable set of vertices shortest Hamiltonian path shortest path shortest path problem shortest spanning tree shown in Fig solution solved Steiner subgraph subproblems subtree theorem travelling salesman problem vector vertex degrees vertex xf vertices of G vertices xf zero