Regular ArticleOn Minimum Edge Ranking Spanning Trees☆
References (14)
- et al.
On the complexity of partitioning graphs into connected subgraphs
Disc. Appl. Math.
(1985) - et al.
On an edge-ranking problem of trees and graphs
Disc. Appl. Math.
(1991) - et al.
Edge ranking of graphs is hard
Disc. Appl. Math.
(1998) - et al.
Ranking of graphs
SIAM J. Disc. Math.
(1998) - et al.
Optimal edge ranking of trees in polynomial time
Algorithmica
(1995) - et al.
Approximating the minimum-degree Steiner tree to within one of optimal
J. Algorithms
(1984)
There are more references available in the full text version of this article.
Cited by (27)
The complexity of bicriteria tree-depth
2023, Theoretical Computer ScienceOn the tree search problem with non-uniform costs
2016, Theoretical Computer ScienceCitation Excerpt :The Tree Search Problem with non-uniform costs The Tree Search Problem has been first studied under the name of tree edge ranking [9,5,12,14,7], motivated by multi-part product assembly. In [12] it was shown that in the case where the tests have uniform cost, an optimal strategy can be found in linear time.
Facial edge ranking of plane graphs
2015, Discrete Applied MathematicsThe binary identification problem for weighted trees
2012, Theoretical Computer ScienceEdge ranking and searching in partial orders
2008, Discrete Applied MathematicsNp-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
2006, Discrete Applied Mathematics
- ☆
This research was partially supported by the Scientific Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan under Grant 11750353.
- 2
Corresponding author.
Copyright © 2001 Academic Press. All rights reserved.