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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhattacharjee, A., Hasan, C.S., Kashem, M.A.: An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Series-Parallel Graphs. In: 4th International Conference on Electrical and Computer Engineering, pp. 328–332 (2006)
Chang, R.-Y., Lee, G., Peng, S.-L.: Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. In: International Conference on Intelligent Computing, pp. 758–765 (2008)
Deng, H., Guha, S., Sen, A.: On a Graph Partition Problem with Application to VLSI Layout. Information Processing Letters 43, 87–94 (1992)
Greenlaw, R., Schäffer, A.A., de la Torre, P.: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13, 592–618 (1995)
Iyer, A.V., Ratliff, H.D., Vijayan, G.: Parallel Assembly of Modular Products–an Analysis. Technical Report, Georgia Institute of Technology (1988)
Iyer, A.V., Ratliff, H.D., Vijayan, G.: On Edge Ranking Problems of Trees and Graphs. Discrete Applied Mathematics 30, 43–52 (1991)
Leiserson, C.E.: Area Efficient Graph Layouts for VLSI. In: 21st Annual IEEE Symposium of Foundations of Computer Science, pp. 270–281 (1980)
Masuyama, S., Miyata, K., Nakayama, S., Zhao, L.: NP-Hardness Proof and an Approximation Algorithm for the Minimum Vertex Ranking Spanning Tree Problem. Discrete Applied Mathematics 154, 2402–2410 (2006)
Masuyama, S., Nakayama, S.: An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 86-A(5), 1019–1026 (2003)
Masuyama, S., Nakayama, S.: An 0(n 3) Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Permutation Graphs. In: 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2005)
Masuyama, S., Nakayama, S.: A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplannar Graphs. IEICE Transactions on Information and Systems 89-D(8), 2357–2363 (2006)
Nevins, J., Whitney, D.: Concurrent Design of Products and Processes. McGraw-Hill, New York (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, RY., Lee, G., Peng, SL. (2009). Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)