Technical Report, Issue 588The School, 1983 - Operations research |
Other editions - View all
Common terms and phrases
A. J. Hoffman A. W. J. Kolen adjacent applying row Chang and G. L. Chang and Nemhauser characterization chordal graph closed neighborhood matrices column permutations columns correspond combinatorial algorithm Consider the cycle contain an n-cycle contains an n-sun Cornell University Corollary Discrete Methods exactly Farber G is chordal G is K-SF-chordal G is OSF-chordal G. J. Chang G. L. Nemhauser graph G graphs and K-balanced implies induced subgraph induction Industrial Engineering inner vertices integer programs K-BALANCED CLOSED NEIGHBORHOOD k-Domination K-SF-chordal graph K-sun-free chordal Lemma Linear Programming Lubiw Math matrices in terms matrices of graphs matrix is K-balanced n-cycle matrix n-cycle submatrix n-hole Operations Research outer vertices polynomial Problems Proof Proposition Research and Industrial resp rows and columns runs of length School of Operations Strongly Chordal Suppose K satisfies terms of closed totally balanced matrices vertex vertices of H w-x chord X₁ Xj+1 y-z chord