Congressus Numerantium, المجلد 171Utilitas Mathematica Pub. Incorporated, 1970 |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
2-stratified algorithm array bipartite graph C₁ clique coloring Combinatorial comma-free code complete bipartite graph complete graph Computer congestion CONGRESSUS NUMERANTIUM 171 conjecture constraint graph contains coordinate covering designs cubic graphs data block defined denote distance preserving forest duality edge-graceful labelings edges entry extremal graphs Figure function graceful labeling graph G Graph Theory induced subgraphs integer intersection graphs k-EPT graph k-set k-stratified graph latin square Lemma Let G load balancing Manhattan distance Mathematics minimal multi-type percolation multiset n₁ NP-Complete NP-Hard one-point union optimal pair parallel parity partite set percolation model polynomial processor programming Proof quadruples quads queue queuing system RAID level redundancy routing set of order SH(G shared vertex site percolation slave stratum subgraph subproblems subsets super edge-graceful Theorem tree two-point union V₁ variational problems vector vertex vertex labeling vertex set vertices