scientific article; zbMATH DE number 1305462

zbMath0934.68069MaRDI QIDQ4252349

Kameshwar Munagala, Abhiram G. Ranade

Publication date: 25 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph connectivity

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) 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, An I/O Efficient Algorithm for Minimum Spanning Trees, An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications, Flash memory efficient LTL model checking, On Trade-Offs in External-Memory Diameter-Approximation, Semi-external LTL Model Checking, Optimal cache-oblivious mesh layouts, Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking, 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, I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs, An external memory data structure for shortest path queries