Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing: Held October 1,2,3, 1987 at Winnipeg, Volume 1 |
Other editions - View all
Common terms and phrases
a₁ adjacent algorithm approximation assume binary relation bipartite bipartite graph Borel space chordal graphs chromatic polynomial clique codeword cograph complexity Computer Science consider constraint construction contains convergence Corollary cycle database space decomposition defined definition deletion denote distribution invariant Dunham edge edge-graceful edge-graceful labeling edge-minimal vertex sequence elements equations example exists Figure fragment Gaussian elimination given graph G heuristic integer interval graphs iteration join attributes k-combinations labels latin squares Lee's frame Lemma length Levenshtein distance linear mapping Math Mathematics matrix method minimizing Minimum Detour node nonlinear NP-complete obtained optimal pair partition partitioned databases path plane procedure processes processors Proof R₁ relation schemes S₂ satisfied semijoin solution solving squares with holes step string structure subgraph subset subspace symmetric latin squares Theorem Theory threshold graphs topological space transformation two-way join unicyclic unicyclic graph vector vertices