Convex Quadratic Programming Approach to the Maximum Matching Problem

Journal of Global Optimization

Volumn 21, Issue 1, 2001, Pages 91-106

  Cardoso, Domingos M ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

Convex programming; Graph eigenvalues; Graph theory; Maximum matching

Indexed keywords

EID: 0035444491     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017969603632     Document Type: Article

References (14)

1. I.M. Bomze, (1998), On standard quadratic optimization problems. Journal of Global Optimization 13: 369-387.
2. Cvetkovic, D., Doob, M. and Sachs, H., (1979), Spectra of Graphs - Theory and Applications. Academic Press, New York.
3. Doob, M. (1973), An interrelation between line graphs, eigenvalues, and matroids. Journal of Combinatorial Theory, B 15: 40-50.
4. Edmonds, J.R. (1965), Paths, trees and flowers. Canadian Journal of Mathematics, 17: 449-467.
5. Gibbons, L.E., Hearn, D.W., Pardalos, P.M. and Ramana, M.V., (1997), Continuous characterizations of the maximum clique problem. Mathematical Methods of Operations Research 22: 754-768.
6. Las Vergnas, M. (1975), A note on matchings in graphs. Colloque sur la Théorie des Graphes (Paris, 1974). Cahiers Centre Études Recherche Opérationnelle 17: 257-260.
7. Lovász, L. and Plummer, M.D. (1986), Matching theory. Annals of Discrete Mathematics, 29. North-Holland, Amsterdam.
8. Luz, C.J. (1995), An upper bound on the independence number of a graph computable in polynomial time. Operations Research Letters 18: 139-145.
9. Luz, C.J. and Cardoso, D.M. (1998), A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph. Annals of Operations Research 81: 307-309.
10. Motzkin, T.S. and Straus, E.G. (1965), Maxima for graphs and a new proof of a theorem of Turán. Canadian Journal of Mathematics, 17: 533-540.
11. Pulleyblank, W.R. (1995), Matchings and Extensions. In Graham, R.L. Grotschel M. and Lovász, L. (eds), Handbook of Combinatorics, vol. I, pages 180-232. North-Holland, Amsterdam.
12. Lozin, V.V. and Cardoso, D.M. (1999), On hereditary properties of the class of graphs with quadratic stability number. Cadernos de Matemática, CM/I-50, Departamento de Matemática da Universidade de Aveiro.
13. Minty, G.J. (1980), On maximal independent sets of vertices in claw-free graphs. Journal of Combinatory Theory, B 28: 284-304.
14. Sbihi, N. (1980), Algorithm de recherche dun stable de cardinalité maximum dans un graphe sans etoile. Discrete Mathematics, 29: 53-76.