## Combinatorial algorithms, 1972-1973 |

### What people are saying - Write a review

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

### Contents

INTRODUCTORY CONCEPTS | 1 |

ENUMERATIVE TECHNIQUES | 18 |

GRAPH ALGORITHMS | 29 |

Copyright | |

3 other sections not shown

### Common terms and phrases

3-Dimensional Matching adjacency structure backtrack bicenters biconnected component binary fraction binary tree capacity Clique problem colors Combinatorial Algorithms Combinatorial mathematics combinatorial problems compute consider construct contains defined Definition depth first search digraph Dilworth's Problem Dilworth's Theorem directed graph Directed Hamiltonian edge element vector Endorder estack example finite sets given graph G Graph Theory Hamiltonian Circuit incidence matrix input Isomorph rejection Karp Karp-Cook Knuth labeled linear programming linear programming problem lowpt(v Max Cut maximal method n-connected network flow network flow algorithm nonnegative integer notation Note num(l num(v num(w number of O's p-clique pair partially ordered set path PDOT planar graphs plane rooted tree planted plane trees polynomial polynomial-bounded positive integer RC WO YS representation represented Routine Satisfiability problem scan SCANLIST Set Covering problem set of vertices shown solution vector solved subgraph symmetry thru step Traverse unique unlabeled vertex zero