Pages that link to "Item:Q2322695"
From MaRDI portal
The following pages link to Space efficient linear time algorithms for BFS, DFS and applications (Q2322695):
Displayed 10 items.
- Space-efficient vertex separators for treewidth (Q2165026) (← 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 algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- (Q5092430) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Sorting and ranking of self-delimiting numbers with applications to tree isomorphism (Q6182920) (← links)