1 resultado para Matching-to-sample arbitrário
em Repositório Institucional da Universidade de Aveiro - Portugal
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (1)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (20)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (14)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (13)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- Bioline International (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (32)
- Boston University Digital Common (1)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (10)
- CentAUR: Central Archive University of Reading - UK (25)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (24)
- Cochin University of Science & Technology (CUSAT), India (2)
- Coffee Science - Universidade Federal de Lavras (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (50)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (10)
- DigitalCommons@The Texas Medical Center (8)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Greenwich Academic Literature Archive - UK (2)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (6)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (18)
- Instituto Politécnico de Viseu (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (6)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (4)
- National Center for Biotechnology Information - NCBI (10)
- Nottingham eTheses (3)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (40)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (38)
- Queensland University of Technology - ePrints Archive (333)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (57)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- School of Medicine, Washington University, United States (5)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (9)
- Universidade Complutense de Madrid (4)
- Universidade Federal do Pará (50)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universita di Parma (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal (3)
- Université de Montréal, Canada (15)
- Université Laval Mémoires et thèses électroniques (2)
- University of Connecticut - USA (2)
- University of Michigan (10)
- University of Queensland eSpace - Australia (21)
- University of Southampton, United Kingdom (1)
- University of Washington (3)
- WestminsterResearch - UK (1)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
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.