Abstract
Given a graph G, we intend to partition its nodes into two sets of equal size so as to minimize the sum of the cost of arcs having end-points in different sets. This problem, called the uniform Graph Partitioning Problem (GPP), is known to be NP-Complete. In this paper we propose the first reported learning-automaton based solution to the problem. We compare this new solution to various reported schemes such as the Kernighan-Lin's algorithm, and two excellent recent heuristic methods proposed by Rolland et. al. — an extended local search algorithm and a genetic algorithm. The current automaton-based algorithm outperforms all the other schemes. We believe that it is the fastest algorithm reported to date. Additionally, our solution can also be adapted for the GPP in which the edge costs are not constant but random variables whose distribution are unknown.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Cox Jr., L. A., Davis, L. and Qiu, Y., “Dynamic Anticipatory Routing in Circuit-Switched Telecommunications Networks”, Handbook of Genetic Algorithms (Ed. by L. Davis), Van Nostrand Reinhold, New York, 1991.
De Jong, K. A. and Spears, W.M., “Using Genetic Algorithms to Solve NP-Complete Problems”, Proceedings of the 3rd International Conference on Genetic Algorithms (J. D. Schaffer, ed.). George Mason University, 1989.
Feo, T.A. and Khellaf, M., “A Class of Bounded Approximation Algorithms for Graph Partitioning”, Networks. 20, 181–195, 1990.
Garey, M. R. and Johnson, D.S., Computers and intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
Goldberg, D. E. and Lingle, R., “Alleles, Loci, and the Travelling Salesman”, Proceedings of an International Conference on Genetic Algorithms and their Applications. Carnegie-Mellon University, Pittsburgh, PA., 1985.
Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company, Reading, MA., 1989.
Golden, B. L. and Skiscim, C.C., “Using Simulated Annealing to Solve Routing and Location Problems”, Naval Research Logistics Quarterly, 33, 261–279, 1986.
Hosage, C. M. and Goodchild, M.F., “Discrete Space Allocation Solutions From Genetic Algorithms”, The Third International Conference on Locational Decision Making (ISOLDE III), 1986.
Johnson, D. S., Aragon, C.R., McGeoch, L.A. and Schevon, C., “Optimization by Simulated Annealing: An Experimental Evaluation; Part 1, Graph Partitioning”, Operations Research, 37, 6, 1989.
Kernighan, B.W. and Lin, S., “An Efficient Heuristic Procedure For Partitioning Graphs”. The Bell Systems Technical Journal, 49, 291–307, 1970.
Lin, S., “Computer Solutions of the TSP”, Bell Systems Technical Journal, 44, 1965.
Nilsson, N.J., Principles of Artificial Intelligence, Tioga Publishing, California, 1980.
Narendra, K.S. and Thathachar, M.A.L., Learning Automata: An Introduction, Englewood Cliffs, New Jersey: Prentice-Hall, Inc., 1989.
Oommen, B.J. and De St. Croix, T., “Graph Partitioning Using Automata”. Unabridged version of this paper. Can be obtained as a technical report from the School of Computer Science, Carleton University, Ottawa.
Oommen, B.J. and Fothergill, C., “Fast Learning Automaton-Based Image Examination and Retrieval”, The Computer Journal, Vol. 36, No. 6, 1993, pp. 542–553.
Oommen, B.J. and Ma, D.C.Y., “Deterministic Learning Automata Solutions to the Equipartitioning Problem”, IEEE Trans. on Computers, Vol. 37, No. 1, 1988, pp. 2–13.
Oommen, B. J., Valiveti, R.S. and Zgierski, J., “An Adaptive Learning Solution to the Keyboard Optimization Problem”, IEEE Trans. on Systems, Man and Cybernetics, Vol. SMC-21, November/December 1991, pp. 1608–1618. (Corrected version in IEEE Trans. on Systems, Man and Cybernetics, Vol. SMC-22, September/October 1992, pp. 1233–1243).
Oommen, B.J. and Zgierski, J., “A Learning Automaton Solution to Breaking Substitution Cyphers”, IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-15, February 1993, pp. 185–192.
Pirkul, H. and Rolland, E., “New Heuristic Solution Procedures for the Uniform Graph Partitioning Problem:Extensions and Evaluation”, working paper, University of California, Riverside, 1991.
Rolland, E., Abstract Heuristic Search methods for Graph Partitioning, Ph.D. dissertation, The Ohio State University, Columbus, Ohio. 1991.
Rolland, E. and Pirkul, H., “Heuristic Solution Procedures for the Graph Partitioning Problem”, Proceedings of the 1992 ORSA-CSTS Conference on Computer Science and Operations Research: New Developments in Their Interfaces, Williamsburg, VA, January 1992, pp. 475–490.
Tsetlin, M.L., “Automaton Theory and the Modelling of Biological Systems”, New York and London, Academic, 1973.
Yu, C.T., Siu, M.D., Lam, D. and Tai, T., “Adaptive Clustering Schemes: General Framework” in Proc. of the IEEE COMPSAC Conference, 1981, pp. 81–89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oommen, B.J., de St. Croix, E.V. (1995). On using learning automata for fast graph partitioning. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_109
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive