Pages that link to "Item:Q2420652"
From MaRDI portal
The following pages link to Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652):
Displaying 6 items.
- Fast breadth-first search in still less space (Q2301537) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- (Q5092430) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710824) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)