Sciweavers

2 search results - page 1 / 1
» The Size of the Smallest Strong Critical Set in a Latin Squa...
Sort
View
ARSCOM
1999
97views more  ARSCOM 1999»
13 years 4 months ago
The Size of the Smallest Strong Critical Set in a Latin Square
A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
John A. Bate, G. H. John van Rees
ARSCOM
2008
119views more  ARSCOM 2008»
13 years 5 months ago
Greedy Defining Sets in Latin Squares
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
Manouchehr Zaker