Digraphs Definition for an Array Maintenance Problem
| Data(s) |
09/04/2009
03/09/2009
09/04/2009
03/09/2009
2008
|
|---|---|
| Resumo |
In this paper we present a data structure which improves the average complexity of the operations of updating and a certain type of retrieving information on an array. The data structure is devised from a particular family of digraphs verifying conditions so that they represent solutions for this problem. |
| Identificador |
1313-0463 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #array maintenance #average complexity #data structures #models of computation |
| Tipo |
Article |
