Abstract
This paper provides an algorithm for finding feedback vertex set in rotator graphs. Feedback vertex set is a subset of a graph whose removal causes an acyclic graph and is developed in various topologies of interconnected networks. In 1992, Corbett pioneered rotator graphs, whose interesting topological structures attract many researchers to publish relative papers in recent years. In this paper, we first develops feedback vertex set algorithm for rotator graphs. Our algorithm utilizes the technique of dynamic programming and generates a feedback vertex set of size n!/3 for a rotator graph of scale n, which contains n! nodes. The generated set size is proved to be minimum. Finding a minimum feedback vertex set is a NP-hard problem for general graphs. The time complexity of our algorithm, which finds a minimum feedback vertex set for a rotator graph of scale n, is proved to be O(n nāāāā3).
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
Corbett, P.F.: Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks. IEEE Transactions on Parallel and Distributed SystemĀ 3(5), 622ā626 (1995)
Chen, C., Agrawal, D.P., Burke, J.: dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout. IEEE Trans. on Parallel and Distributed SystemsĀ 4, 1332ā1344 (1993)
Caragiannis, C., Kaklamanis, P.: Kanellopoulos: New Bounds on The Size of The Feedback Vertex Set on Meshes and Butterflies. Information Processing LettersĀ 83(5), 275ā280 (2002)
Flood, M.M.: Exact and Heuristic Algorithms for The Weighted Feedback Arc Set Problem: A special case of the skew-symmetric quadratic assignment problem. NetworksĀ 20, 1ā23 (1990)
Floyd, R.: Assigning Meaning to Programs. In: Proceedings of Symposium on Applied Mathematics, pp. 19ā32 (1967)
Focardi, R., Luccio, F.L., Peleg, D.: Feedback Vertex Set in Hypercubes. Information Processing LettersĀ 76(1-2), 1ā5 (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability, Freeman, San Francisco, CA (1979)
Yannakakis, M.: Node-Deletion Problem on Bipartite Graphs. SIAM Journal on ComputingĀ 10, 310ā327 (1981)
Luccio, F.L.: Exact Minimum Feedback Vertex Set in Meshes and Butterflies. Information Processing LettersĀ 66(2), 59ā64 (1998)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New Bounds on The Size of The Feedback Vertex Set on Meshes and Butterflies. Information Processing LettersĀ 83(5), 275ā280 (2002)
Focardi, R., Luccio, F.L., Peleg, D.: Feedback Vertex Set in Hypercubes. Information Processing LettersĀ 76(1-2), 1ā5 (2000)
Wang, F.H., Wang, Y.L., Chang, J.M.: Feedback Vertex Sets in Star Graphs. Information Processing LettersĀ 89(4), 203ā208 (2004)
Kralovic, R., Ruzicka, P.: Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. Information Processing LettersĀ 86(4), 191ā196 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, CC., Lin, HR., Chang, HC., Lin, KK. (2006). Feedback Vertex Sets in Rotator Graphs. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751649_17
Download citation
DOI: https://doi.org/10.1007/11751649_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34079-9
Online ISBN: 978-3-540-34080-5
eBook Packages: Computer ScienceComputer Science (R0)