On Minimum Edge Ranking Spanning Trees
From MaRDI portal
Publication:2729646
DOI10.1006/jagm.2000.1143zbMath0974.68152OpenAlexW1968569027MaRDI QIDQ2729646
Yushi Uno, Toshihide Ibaraki, Kazuhisa Makino
Publication date: 23 July 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1143
Related Items (12)
On the tree search problem with non-uniform costs ⋮ Minimum edge ranking spanning trees of split graphs ⋮ NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem ⋮ Conflict-free connections of graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ Facial edge ranking of plane graphs ⋮ Edge ranking and searching in partial orders ⋮ The binary identification problem for weighted trees ⋮ Edge ranking of weighted trees ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth ⋮ On the Tree Search Problem with Non-uniform Costs
This page was built for publication: On Minimum Edge Ranking Spanning Trees
