Pages that link to "Item:Q2729646"
From MaRDI portal
The following pages link to On minimum edge ranking spanning trees (Q2729646):
Displaying 13 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← 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)
- Conflict-free connections of graphs (Q1656907) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Minimum vertex ranking spanning tree problem for chordal and proper interval graphs (Q3559377) (← 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)