Pages that link to "Item:Q2942660"

The following pages link to Depth-First Search Using $$O(n)$$ Bits (Q2942660):

Displaying 18 items.

• Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
• Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← 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)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733) (← 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 algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
• Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
• Simple 2^f-Color Choice Dictionaries (Q5091061) (← links)
• Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)