The following pages link to Edge ranking of weighted trees (Q2495900):
Displayed 13 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Edge and pair queries-random graphs and complexity (Q6162142) (← links)