Minimum edge ranking spanning trees of split graphs

Citations of this article
Mendeley users who have this article in their library.


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 split 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. We also show that the problem MERST for threshold graphs can be solved in linear time, where threshold graphs are known to be split. © 2006 Elsevier B.V. All rights reserved.




Makino, K., Uno, Y., & Ibaraki, T. (2006). Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics, 154(16), 2373–2386.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free