Pages that link to "Item:Q2300733"
From MaRDI portal
The following pages link to Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733):
Displaying 15 items.
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Space-efficient Basic Graph Algorithms (Q2955003) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- (Q4553236) (← links)
- Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (Q4636504) (← links)
- A Snap-Stabilizing DFS with a Lower Space Requirement (Q5307031) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
