1 resultado para Human face recognition (Computer science)
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Filtro por publicador
- Repository Napier (1)
- Aberystwyth University Repository - Reino Unido (3)
- Academic Archive On-line (Jönköping University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (18)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Applied Math and Science Education Repository - Washington - USA (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (27)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- Cambridge University Engineering Department Publications Database (55)
- CentAUR: Central Archive University of Reading - UK (7)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (10)
- Cochin University of Science & Technology (CUSAT), India (8)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (73)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (10)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (5)
- Helda - Digital Repository of University of Helsinki (4)
- Indian Institute of Science - Bangalore - Índia (31)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (12)
- Ministerio de Cultura, Spain (3)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (52)
- Queensland University of Technology - ePrints Archive (450)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (13)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (2)
- Research Open Access Repository of the University of East London. (2)
- SAPIENTIA - Universidade do Algarve - Portugal (3)
- Scielo Uruguai (1)
- Universidad de Alicante (7)
- Universidad Politécnica de Madrid (15)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (9)
- University of Canberra Research Repository - Australia (2)
- University of Michigan (17)
- University of Queensland eSpace - Australia (11)
- University of Southampton, United Kingdom (7)
- University of Washington (4)
- WestminsterResearch - UK (2)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
This report is an introduction to the concept of treewidth, a property of graphs that has important implications in algorithms. Some basic concepts of graph theory are presented in the first chapter for those readers that are not familiar with the notation. In Chapter 2, the definition of treewidth and some different ways of characterizing it are explained. The last two chapters focus on the algorithmic implications of treewidth, which are very relevant in Computer Science. An algorithm to compute the treewidth of a graph is presented and its result can be later applied to many other problems in graph theory, like those introduced in the last chapter.