Pages that link to "Item:Q650925"
From MaRDI portal
The following pages link to On the complexity of searching in trees and partially ordered structures (Q650925):
Displaying 6 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Searching for quicksand ideals in partially ordered sets (Q4990125) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
