Sciweavers

4 search results - page 1 / 1
» Greedy Defining Sets in Latin Squares
Sort
View
ARSCOM
2008
119views more  ARSCOM 2008»
13 years 11 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
ENDM
2006
127views more  ENDM 2006»
13 years 10 months ago
Greedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
Manouchehr Zaker
IJCM
2002
97views more  IJCM 2002»
13 years 10 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
TASE
2010
IEEE
13 years 5 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen