Abstract
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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Makino, K., Uno, Y., & Ibaraki, T. (2002). Minimum edge ranking spanning trees of threshold graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 428–440). https://doi.org/10.1007/3-540-36136-7_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
