Sciweavers

Share
IWOCA
2009
Springer
112views Algorithms» more  IWOCA 2009»
10 years 4 months ago
The Guarding Problem - Complexity and Approximation
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
10 years 4 months ago
On the Maximal Number of Cubic Subwords in a String
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 ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
IWOCA
2009
Springer
160views Algorithms» more  IWOCA 2009»
10 years 4 months ago
Note on Decomposition of Kn, n into (0, j)-prisms
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 ...
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Minimax Trees in Linear Time with Applications
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...
Pawel Gawrychowski, Travis Gagie
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Randomized Postoptimization of Covering Arrays
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...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Fast Convolutions and Their Applications in Approximate String Matching
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...
Kimmo Fredriksson, Szymon Grabowski
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
10 years 6 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
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...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
IWOCA
2009
Springer
193views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Gray Code Compression
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...
Darko Dimitrov, Tomás Dvorák, Petr G...
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
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...
David Coudert, Frédéric Giroire, Ign...
IWOCA
2009
Springer
120views Algorithms» more  IWOCA 2009»
10 years 6 months ago
Polynomial Kernels for 3-Leaf Power Graph Modification Problems
Stéphane Bessy, Christophe Paul, Anthony Pe...
books