Space-efficient basic graph algorithms
From MaRDI portal
Recommendations
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Space efficient linear time algorithms for BFS, DFS and applications
- Improved space efficient algorithms for BFS, DFS and applications
- Depth-First Search Using O(n) Bits
- scientific article; zbMATH DE number 1305462
Cited in
(33)- Approximation in (poly-) logarithmic space
- Reversibility of computations in graph-walking automata
- Succinct planar encoding with minor operations
- Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
- Trading uninitialized space for time
- scientific article; zbMATH DE number 7561708 (Why is no real title available?)
- Simple 2f-Color Choice Dictionaries
- Improved space efficient algorithms for BFS, DFS and applications
- Depth-first search in directed planar graphs, revisited
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Space-efficient Euler partition and bipartite edge coloring
- Frameworks for designing in-place graph algorithms
- Space-efficient vertex separators for treewidth
- Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
- A framework for in-place graph algorithms
- A space-efficient algorithm for finding strongly connected components
- Space-efficient algorithms for longest increasing subsequence
- Space-efficient algorithms for longest increasing subsequence
- Lower bounds for graph-walking automata
- Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
- Space-efficient graph coarsening with applications to succinct planar encodings
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Space efficient linear time algorithms for BFS, DFS and applications
- Succinct data structure for chordal graphs with bounded vertex leafage
- Optimal In-place Algorithms for Basic Graph Problems
- Efficient algorithms with asymmetric read and write costs
- Space-Efficient Euler Partition and Bipartite Edge Coloring
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Space-efficient biconnected components and recognition of outerplanar graphs
- Space-efficient biconnected components and recognition of outerplanar graphs
- Memory efficient algorithms for cactus graphs and block graphs
This page was built for publication: Space-efficient basic graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955003)
