The minimum vertex ranking spanning tree problem on graph
is to find a spanning tree
such that the minimum vertex ranking of
is minimum among all possible spanning trees of
. In this paper, we propose a linear-time algorithm for this problem on permutation graphs. It improves a previous result that runs in
) time where
is the number of vertices in the input graph.