310 search results - page 22 / 62 » dam 2008 |
113
click to vote
DAM
2006
15 years 3 months ago
2006
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
153
click to vote
DAM
2006
15 years 3 months ago
2006
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
117
click to vote
DAM
2007
15 years 3 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
109
click to vote
DAM
2007
15 years 3 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
111
click to vote
DAM
2007
15 years 3 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...