scientific article; zbMATH DE number 1305462
From MaRDI portal
Publication:4252349
Recommendations
Cited in
(21)- An external-memory depth-first search algorithm for general grid graphs
- An external memory data structure for shortest path queries
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- Space-efficient basic graph algorithms
- Upper and lower I/O bounds for pebbling \(r\)-pyramids
- An I/O efficient algorithm for minimum spanning trees
- On Trade-Offs in External-Memory Diameter-Approximation
- Semi-external LTL Model Checking
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
- A general lower bound on the I/O-complexity of comparison-based algorithms
- I/O-efficient algorithms for topological sort and related problems
- Cache oblivious minimum cut
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- I/O-Efficient Algorithms for Topological Sort and Related Problems
- Flash memory efficient LTL model checking
- Optimal cache-oblivious mesh layouts
- I/O-efficient algorithms for graphs of bounded treewidth
- External-memory depth-first search algorithm for solid grid graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252349)
