20 search results - page 2 / 4 » iwoca 2009 |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
d abstract) Thomas Feierl⋆ Fakult¨at f¨ur Mathematik Universit¨at Wien Nordbergstr. 15 1090 Wien, Austria Abstract. We determine the weak limit of the distribution of the rand...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
IWOCA
2009
Springer
14 years 2 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 2 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...