The following pages link to (Q4515740):
Displaying 6 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- On the average length of lexicographic paths (Q3735459) (← links)
- The average complexity of depth-first search with backtracking and cutoff (Q3776618) (← links)
- Average-Case Lower Bounds for Searching (Q3813304) (← links)
- Upper and lower bounds for the average-case complexity of path-search (Q4262014) (← links)