Combinatorial Algorithms, 1972-1973 |
Common terms and phrases
adjacency matrix adjacency structure backtrack bicenters biconnected component binary tree C₁ characteristic function clauses Clique problem colors combinatorial algorithms Combinatorial Mathematics combinatorial problems compute consider contains Covering problem cycle index cyclic permutation d₁ d₂ defined Definition depth first search diagonal digraph Dilworth's Problem Dilworth's Theorem directed graph distinct vertices edge element vector endpoint equivalence estack example finite sets given graph G Graph Theory Harary incidence matrix input Isomorph rejection labeled linear programming linear programming problem LOWPT(w maximal method monotone n-connected network flow Node Cover nonnegative integer num(v num(w number of elements partial vector partially ordered set path PDOT planar graphs planted plane trees polynomial-bounded positive integer RC WO YS representation represented rooted tree routine Satisfiability problem Set Covering set of vertices simple cyclic permutation solution vector subgraph subtree symmetric group symmetry Tarjan thru step Traverse undefined unique V₁ variables vertex zero