Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/15344
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLuz, Carlos J.pt
dc.date.accessioned2016-03-21T16:02:04Z-
dc.date.available2018-07-20T14:00:52Z-
dc.date.issued2015-12-31-
dc.identifier.issn1793-8309pt
dc.identifier.urihttp://hdl.handle.net/10773/15344-
dc.description.abstractFor any graph $G,$ Luz and Schrijver \cite{LuzSchrijver} introduced a characterization of the Lov\'{a}sz number $\vartheta(G)$ based on convex quadratic programming. A similar characterization is now established for the weighted version of the number $\vartheta^{\prime}(G),$ independently introduced by McEliece, Rodemich, and Rumsey \cite{McElieceetal} and Schrijver \cite{Schrijver1}. Also, a class of graphs for which the weighted version of $\vartheta^{\prime}(G)$ coincides with the weighted stability number is characterized.pt
dc.language.isoengpt
dc.publisherWorld Scientificpt
dc.relationFCT - UID/MAT/04106/2013pt
dc.rightsopenAccesspor
dc.subjectLovász numberpt
dc.subjectMcEliece–Rodemich–Rumsey–Schrijver numberpt
dc.subjectMaximum weight stable setpt
dc.subjectCombinatorial optimizationpt
dc.subjectGraph theorypt
dc.subjectQuadratic programmingpt
dc.titleA characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programmingpt
dc.typearticlept
dc.peerreviewedyespt
ua.distributioninternationalpt
degois.publication.issue4pt
degois.publication.titleDiscrete Mathematics, Algorithms and Applicationspt
degois.publication.volume7pt
dc.date.embargo2016-12-30T16:00:00Z-
dc.identifier.doi10.1142/S1793830915500500pt
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
ArtigoCJLuzDMMA2015.pdfpdf271.74 kBAdobe PDFView/Open


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

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