ON-LINE PLANARITY TESTING*
... decomposition of a graph into its biconnected and triconnected components. The rest of this paper is organized as follows, in 2, we survey previous results on dynamic graph algorithms. Section 3 provides basic definitions. In 4, we present a static data structure that supports only operation Test in ...
... decomposition of a graph into its biconnected and triconnected components. The rest of this paper is organized as follows, in 2, we survey previous results on dynamic graph algorithms. Section 3 provides basic definitions. In 4, we present a static data structure that supports only operation Test in ...
Instance Optimal Geometric Algorithms
... model: for every input sequence of n points, one can easily design an algorithm A′ (with its code depending on the input sequence) that runs in O(n) time on that particular sequence, thus ruling out the existence of an instance-optimal algorithm.1 To get a more useful definition, we suggest a varian ...
... model: for every input sequence of n points, one can easily design an algorithm A′ (with its code depending on the input sequence) that runs in O(n) time on that particular sequence, thus ruling out the existence of an instance-optimal algorithm.1 To get a more useful definition, we suggest a varian ...
In-memory hash tables for accumulating text vocabularies
... this drawback — and space management within Btree nodes must be either array-based, giving costly insertion, or tree-based, thus ensuring that B-trees are less space efficient than the other strategies. Skip lists, moreover, require more key comparisons than the other schemes [4]; in our experiments ...
... this drawback — and space management within Btree nodes must be either array-based, giving costly insertion, or tree-based, thus ensuring that B-trees are less space efficient than the other strategies. Skip lists, moreover, require more key comparisons than the other schemes [4]; in our experiments ...
space-efficient data structures for collections of textual data
... The thesis is structured as follows. After a brief review of the basic concepts and tools, we present our contributions, which are summarized below. We then conclude the thesis with some directions for future work and open problems. SEMI-INDEXING TEXTUAL SEMI-STRUCTURED DATA. Semi-structured textual ...
... The thesis is structured as follows. After a brief review of the basic concepts and tools, we present our contributions, which are summarized below. We then conclude the thesis with some directions for future work and open problems. SEMI-INDEXING TEXTUAL SEMI-STRUCTURED DATA. Semi-structured textual ...
Lecture 3 Data Structures (DAT037)
... (though inserDng at the end takes O(1) Dme) (and you can also delete from the middle in O(1) Dme if you don't care about preserving the order) • A linked list supports inserDng and dele ...
... (though inserDng at the end takes O(1) Dme) (and you can also delete from the middle in O(1) Dme if you don't care about preserving the order) • A linked list supports inserDng and dele ...
COSC 2006 Data Structures I
... The equals method compares only the title of the books. Here we try out the getClass() method which returns the class name of the object instead of using instance of which cannot distinguish different classes in an inheritance hierarchy (returns true for all the subclasses) ...
... The equals method compares only the title of the books. Here we try out the getClass() method which returns the class name of the object instead of using instance of which cannot distinguish different classes in an inheritance hierarchy (returns true for all the subclasses) ...
Quadtree
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The regions may be square or rectangular, or may have arbitrary shapes. This data structure was named a quadtree by Raphael Finkel and J.L. Bentley in 1974. A similar partitioning is also known as a Q-tree. All forms of quadtrees share some common features: They decompose space into adaptable cells Each cell (or bucket) has a maximum capacity. When maximum capacity is reached, the bucket splits The tree directory follows the spatial decomposition of the quadtree.