P. K. Agarwal, L. Arge, T. M. Murali, K. Varadarajan, and J. S. Vitter. I/Oefficient algorithms for contour line extraction and planar graph blocking. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 117--126, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On External-Memory MST, SSSP and Multi-way Planar Graph.. - Arge, Brodal, al. (2000) (Correct)
.... Gamma sort(E) Delta log log V B E Delta [25] MST O Gamma sort(E) Delta log V M Delta [12] O (sort(E) Delta log B scan(E) Delta log V ) 22] SSSP O Gamma V E B Delta log V B Delta [22] I O efficient graph algorithms have been considered by a number of authors [1, 2, 5, 6, 10, 12, 16, 19, 22, 24 26, 29]. Table 1 reviews the best known algorithms for basic graph theoretic problems on general undirected graphs. For directed graphs the best known algorithm for breadth first search (BFS) and depth first search (DFS) use O Gamma (V scan(E) Delta log V B sort(E) Delta I Os [10] Lower ....
P. K. Agarwal, L. Arge, T. M. Murali, K. Varadarajan, and J. S. Vitter. I/Oefficient algorithms for contour line extraction and planar graph blocking. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 117--126, 1998.
External Memory Data Structures - Arge (2000) (15 citations) Self-citation (Arge) (Correct)
....external priority queue. Using the buffer tree technique on a tournament tree, Kumar and Schwabe [107] developed a priority queue supporting update operations in O( 1 B log N B ) I Os. They also showed how to use their structure in several efficient external graph algorithms (see e. g [2, 7, 18, 22, 27, 46, 59, 81, 97, 107, 110, 111, 116, 118, 122, 142, 156] for other results on external graph algorithms and data structures) Note that if the priority of an element is known, an update operation can be performed in O( 1 B log M=B N B ) I Os on a buffer tree using a delete and an insert operation. 4 3 sided planar range searching In internal ....
....each multislab in O(1) blocks. Similar ideas have been utilized in several other external data structures [14, 25, 3, 28] Variants of the external interval tree structure, as well as applications of it in isosurface extraction, have been considered by Chiang and Silva [29, 60, 62, 61] see also [7]) Planar point location. The planar point location problem is defined as follows: Given a planar subdivision with N vertices (i.e. a decomposition of the plane into polygonal regions induced by a straight line planar graph) construct a data structure so that the face containing a query point p ....
P. K. Agarwal, L. Arge, T. M. Murali, K. Varadarajan, and J. S. Vitter. I/Oefficient algorithms for contour line extraction and planar graph blocking. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 117--126, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC