The following pages link to (Q4250211):
Displaying 16 items.
- 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)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- Partial order multiway search (Q6535268) (← links)
