1 resultado para Number of students
em Repositório Institucional da Universidade de Aveiro - Portugal
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (1)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (4)
- Aquatic Commons (9)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (20)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (10)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (40)
- Boston University Digital Common (2)
- Brock University, Canada (14)
- Cambridge University Engineering Department Publications Database (17)
- CentAUR: Central Archive University of Reading - UK (24)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (11)
- Cochin University of Science & Technology (CUSAT), India (3)
- Collection Of Biostatistics Research Archive (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (83)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (4)
- Digital Archives@Colby (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (7)
- DigitalCommons@The Texas Medical Center (7)
- DigitalCommons@University of Nebraska - Lincoln (6)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- Glasgow Theses Service (1)
- Harvard University (10)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (28)
- Instituto Politécnico de Viseu (1)
- Instituto Politécnico do Porto, Portugal (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Ministerio de Cultura, Spain (4)
- National Center for Biotechnology Information - NCBI (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (252)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (42)
- Queensland University of Technology - ePrints Archive (57)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (65)
- School of Medicine, Washington University, United States (1)
- Scielo España (1)
- Universidad de Alicante (9)
- Universidad del Rosario, Colombia (5)
- Universidad Politécnica de Madrid (15)
- Universidade Complutense de Madrid (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (1)
- University of Connecticut - USA (1)
- University of Michigan (160)
- University of Southampton, United Kingdom (1)
- University of Washington (1)
Resumo:
A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.