## Game theory and related topics: proceedings of the (international) Seminar, Bonn, 28-29 September, Hagen, 26-27 September, 1978 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

2 On the structure of all minimum cuts in a network and applications | 8 |

3 Clutter percolation and random graphs Colin McDiarmid | 17 |

4 The use of recurrence relations in computing L B Wilson | 26 |

Copyright | |

9 other sections not shown

### Other editions - View all

### Common terms and phrases

admissible trees analysis applied away-match B-trees binary search trees bound algorithm branch and bound canonical form Christofides club plays clutter percolation theorem colour column Combinatorial competition components conference construct defined denote digraph edge sets edge-colouring edge-disjoint Edmonds element in row example F-square fc-MSTP feasible solution given go to Step graph G greedy algorithm half-competition Hamiltonian circuits home-match independent integer Knapsack Problems Knuth latin square linear assignment problem linear programming lower bound matching Mathematics matroid maximum flow method minimum cuts n-matrix node of F node-value North-Holland Publishing Company objective function obtained optimal optimum outline rectangle path perfect triangle-free 2-matching permutation matrix precedence constraints Proof random graphs random trees Received 1 February recurrence relations sequence solving spanning trees split-value subset subtree symbols timetable transitive closure travelling salesman problem tree of order triangle cluster upper bound vertex vertices weight