Heuristic enhancements of the search for the generation of all perfect matchings

Applied Mathematics Letters

Volumn 9, Issue 2, 1996, Pages 49-53

  Balakrishnarajan, M M ^a   Venuvanalingam, P ^a  

^a BHARATHIDASAN UNIVERSITY   (India)

Author keywords

Artificial intelligence; Combinatorial enumeration; Graph theory; Heuristics; Perfect matching; Search

Indexed keywords

EID: 0011709661     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/0893-9659(96)00011-0     Document Type: Article

References (9)

1. M.M. Balakrishnarajan and P. Venuvanalingam, An artificial intelligence approach for the generation and enumeration of perfect matchings on graphs, Computers Math. Applic. 29 (1), 115-121, (1995).
2. E. Montroll, Lattice statistics, In Applied Combinatorial Mathematics, (Edited by E.F. Bechenbach), pp. 96-143, Wiley, New York, (1964).
3. N. Trinajstić, Chemical Graph Theory, Vol. II, CRC Press, Boca Raton, FL, (1983).
4. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8, 410-421, (1979).
5. M.M. Balakrishnarajan and P. Venuvanalingam, General method for the computation of matching polynomials of graphs, J. Chem. Inf. Comput. Sci. 34, 1122-1126, (1994).
6. K.G. Murthy, An algorithm for ranking all the assignments in order of increasing cost, Operations Research 16, 682-687, (1968).
7. C.R. Chegireddy and H.W. Harnacher, Algorithms for finding k-best perfect matchings, Discrete Applied Math. 18, 155-165, (1987).
8. K. Fakuda and T. Matsui, Finding all minimum cost perfect matchings in bipartite graphs, Networks 22, 461-468, (1992).
9. K. Fakuda and T. Matsui, Finding all the perfect matchings in bipartite graphs, Appl. Math. Lett. 7 (1), 15-18, (1994).