scientific article; zbMATH DE number 910869
From MaRDI portal
Publication:4886043
zbMath0849.68089MaRDI QIDQ4886043
Yi-Jen Chiang, Edward F. Grove, Darren Erik Vengroff, Roberto Tamassia, Jeffrey Scott Vitter, Michael T. Goodrich
Publication date: 4 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
external-memory algorithmsPRAM simulationdeterministic 3-coloring of a cycleexternal depth-first searchproximate-neighboringtime-forward processing
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Cache Oblivious Minimum Cut, I/O-efficient algorithms for graphs of bounded treewidth, External-memory depth-first search algorithm for solid grid graphs, Memory requirements for table computations in partial k-tree algorithms, The buffer tree: A new technique for optimal I/O-algorithms, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep, An I/O Efficient Algorithm for Minimum Spanning Trees, Data-Oblivious Graph Algorithms in Outsourced External Memory, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep, MM: a bidirectional search algorithm that is guaranteed to meet in the middle, Unnamed Item, Certifying induced subgraphs in large graphs, Adapting parallel algorithms to the W-stream model, with applications to graph problems, Oblivious algorithms for multicores and networks of processors, On Trade-Offs in External-Memory Diameter-Approximation, Semi-external LTL Model Checking, Lightweight data indexing and compression in external memory, Optimal cache-oblivious mesh layouts, Cache-Oblivious Red-Blue Line Segment Intersection, I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions, External-memory algorithms for processing line segments in geographic information systems, The complexity of flow on fat terrains and its i/o-efficient computation, Assembling approximately optimal binary search trees efficiently using arithmetics, An Input/Output Efficient Algorithm for Hessenberg Reduction, Design and Engineering of External Memory Traversal Algorithms for General Graphs, An external-memory depth-first search algorithm for general grid graphs, Via Detours to I/O-Efficient Shortest Paths, Heaps and heapsort on secondary storage, Permuting and Batched Geometric Lower Bounds in the I/O Model, I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs, The red-blue pebble game on trees and DAGs with large input, An external memory data structure for shortest path queries
