16 resultados para Evolving tree
Filtro por publicador
- Repository Napier (1)
- Aberystwyth University Repository - Reino Unido (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (15)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (6)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- 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 (26)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (16)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (51)
- Boston University Digital Common (3)
- Brock University, Canada (6)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (62)
- CentAUR: Central Archive University of Reading - UK (81)
- Center for Jewish History Digital Collections (6)
- Chapman University Digital Commons - CA - USA (3)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (87)
- Cochin University of Science & Technology (CUSAT), India (7)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (3)
- Dalarna University College Electronic Archive (6)
- Deakin Research Online - Australia (88)
- Department of Computer Science E-Repository - King's College London, Strand, London (8)
- Digital Commons - Michigan Tech (6)
- Digital Commons @ Winthrop University (2)
- DigitalCommons@University of Nebraska - Lincoln (9)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (9)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (36)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (22)
- Indian Institute of Science - Bangalore - Índia (41)
- Instituto Politécnico do Porto, Portugal (6)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Massachusetts Institute of Technology (6)
- Ministerio de Cultura, Spain (10)
- National Center for Biotechnology Information - NCBI (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (96)
- Queensland University of Technology - ePrints Archive (89)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (5)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (130)
- SAPIENTIA - Universidade do Algarve - Portugal (4)
- School of Medicine, Washington University, United States (1)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (4)
- University of Southampton, United Kingdom (1)
- University of Washington (1)
Resumo:
Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.