Game Theory and Related Topics: Proceedings of the Seminar on Game Theory and Related Topics, Bonn/Hagen, 26-29 September, 1978Otto Moeschlin, Diethard Pallaschke |
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 | 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 club plays clutter percolation theorem colour column Combinatorial components conference construct cycles defined denote digraph edge sets edge-colouring edge-disjoint Edmonds example F-square feasible solution given go to Step graph G greedy algorithm half-competition Hamiltonian circuits heuristic home-match integer k-MSTP Knapsack Problems latin square linear assignment problem linear programming lower bound M₁ 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 P₁ path perfect triangle-free 2-matching permutation matrix Petersen 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 α α