720 search results - page 39 / 144 » Linear k-arboricities on trees |
IJFCS
2008
13 years 8 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
ISBRA
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
EUROCAST
2007
Springer
14 years 16 days ago
2007
Springer
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...