Sciweavers

310 search results - page 37 / 62
» dam 2008
Sort
View
DAM
1999
169views more  DAM 1999»
13 years 9 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
DAM
2006
63views more  DAM 2006»
13 years 10 months ago
A novel use of t-packings to construct d-disjunct matrices
A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-...
Hung-Lin Fu, Frank K. Hwang
DAM
2006
93views more  DAM 2006»
13 years 10 months ago
Update schedules of sequential dynamical systems
Sequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of t...
Reinhard Laubenbacher, Bodo Pareigis
DAM
2007
105views more  DAM 2007»
13 years 9 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
DAM
2010
104views more  DAM 2010»
13 years 8 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...