Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs

Authors:
Ruei-Yuan Chang;Guanling Lee;Sheng-Lung Peng
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan 974;Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan 974;Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan 974
Venue:
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Year:
2009

Citing 6
Cited 0

On an edge ranking problem of trees and graphs

Discrete Applied Mathematics
On a graph partition problem with application to VLSI layout

Information Processing Letters
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs

IEICE - Transactions on Information and Systems
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Area-efficient graph layouts

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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