2069 search results - page 8 / 414 » Linear time algorithms for Clobber |
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
TACAS
2001
Springer
15 years 2 months ago
2001
Springer
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
IWOCA
2009
Springer
15 years 4 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...
VLSID
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...