19 search results - page 1 / 4 » Greedy defining sets in graphs and Latin squares |
95
Voted
ENDM
2006
14 years 9 months ago
2006
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...
ARSCOM
2008
14 years 9 months ago
2008
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...
79
Voted
IJCM
2002
14 years 9 months ago
2002
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...
FFA
2006
14 years 9 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
120
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
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...