On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
On an edge ranking problem of trees and graphs
Discrete Applied Mathematics
Edge ranking of graphs is hard
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
On minimum edge ranking spanning trees
Journal of Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Edge ranking of weighted trees
Discrete Applied Mathematics
Minimum edge ranking spanning trees of split graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
Edge ranking of weighted trees
Discrete Applied Mathematics
Parallel query processing and edge ranking of graphs
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
| Hi-index | 0.00 |
Given a graph G, the minimum edge ranking spanning tree problem (MERST) is to find a spanning tree of G whose edge ranking is minimum. However, this problem is known to be NP-hard for general graphs. In this paper, we show that the problem MERST has a polynomial time algorithm for threshold graphs, which have useful applications in practice. The result is also significant in the sense that this is a first non-trivial graph class for which the problem MERST is found to be polynomially solvable.