20 search results - page 3 / 4 » latin 2000 |
70
Voted
COMBINATORICA
2004
14 years 10 months ago
2004
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...
90
Voted
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
69
Voted
IV
2000
IEEE
15 years 2 months ago
2000
IEEE
The goal to produce effective Optical Character Recognition (OCR) methods has lead to the development of a number of algorithms. The purpose of these is to take the hand-written o...
COMBINATORICS
2000
14 years 10 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
DM
2000
14 years 10 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...