IMI-BAS
 

BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Journal ITA >
2008 >
Volume 15 Number 3 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/72

Title: Digraphs Definition for an Array Maintenance Problem
Authors: Herranz, Angel
Toni, Adriana
Keywords: array maintenance
average complexity
data structures
models of computation
Issue Date: 2008
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: 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.
URI: http://hdl.handle.net/10525/72
ISSN: 1313-0463
Appears in Collections:Volume 15 Number 3

Files in This Item:

File Description SizeFormat
ijita15-3-p13.pdf190.27 kBAdobe PDFView/Open

 




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback