IWOCA
2009
Springer
14 years 5 months ago
2009
Springer
IWOCA
2009
Springer
14 years 5 months ago
2009
Springer
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
IWOCA
2009
Springer
14 years 5 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
