Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/4314
Title: Convex Quadratic Programming Approach to the Maximum Matching Problem
Author: Cardoso, Domingos M.
Keywords: Convex programming
Graph eigenvalues
Graph theory
Maximum matching
Issue Date: 2001
Publisher: Springer Verlag
Abstract: The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.
Peer review: yes
URI: http://hdl.handle.net/10773/4314
ISSN: 0925-5001
Publisher Version: http://www.springerlink.com/content/hp2w356220507t55/
Appears in Collections:MAT - Artigos

Files in This Item:
File Description SizeFormat 
JGlobalOptimization(DCardoso2001).pdfElectronic Version284.38 kBAdobe PDFView/Open    Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.