Pages that link to "Item:Q955315"
From MaRDI portal
The following pages link to Edge ranking and searching in partial orders (Q955315):
Displayed 12 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Searching for quicksand ideals in partially ordered sets (Q4990125) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)