1 resultado para graph cut
em Memorial University Research Repository
Filtro por publicador
- Repository Napier (1)
- Aberystwyth University Repository - Reino Unido (1)
- 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 (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (2)
- Aquatic Commons (3)
- 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 (2)
- Aston University Research Archive (25)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (1)
- 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 (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (4)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- Bibloteca do Senado Federal do Brasil (101)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (83)
- Boston University Digital Common (5)
- Brock University, Canada (12)
- Bulgarian Digital Mathematics Library at IMI-BAS (7)
- Cambridge University Engineering Department Publications Database (38)
- CentAUR: Central Archive University of Reading - UK (29)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (26)
- Cochin University of Science & Technology (CUSAT), India (11)
- Collection Of Biostatistics Research Archive (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (5)
- Deakin Research Online - Australia (48)
- Department of Computer Science E-Repository - King's College London, Strand, London (10)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (4)
- Digital Commons - Montana Tech (3)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (5)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (6)
- Duke University (1)
- Düsseldorfer Dokumenten- und Publikationsservice (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (21)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (18)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (9)
- Indian Institute of Science - Bangalore - Índia (55)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Politécnico de Bragança (2)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (2)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (4)
- Publishing Network for Geoscientific & Environmental Data (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (42)
- Queensland University of Technology - ePrints Archive (87)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (48)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (2)
- 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)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Scielo Uruguai (1)
- South Carolina State Documents Depository (2)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (18)
- Universidade Complutense de Madrid (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (23)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (2)
- Université de Montréal, Canada (4)
- University of Canberra Research Repository - Australia (1)
- University of Michigan (39)
- University of Queensland eSpace - Australia (45)
- University of Southampton, United Kingdom (3)
- University of Washington (4)
- USA Library of Congress (1)
Resumo:
In this thesis, we define the spectrum problem for packings (coverings) of G to be the problem of finding all graphs H such that a maximum G-packing (minimum G- covering) of the complete graph with the leave (excess) graph H exists. The set of achievable leave (excess) graphs in G-packings (G-coverings) of the complete graph is called the spectrum of leave (excess) graphs for G. Then, we consider this problem for trees with up to five edges. We will prove that for any tree T with up to five edges, if the leave graph in a maximum T-packing of the complete graph Kn has i edges, then the spectrum of leave graphs for T is the set of all simple graphs with i edges. In fact, for these T and i and H any simple graph with i edges, we will construct a maximum T-packing of Kn with the leave graph H. We will also show that for any tree T with k ≤ 5 edges, if the excess graph in a minimum T-covering of the complete graph Kn has i edges, then the spectrum of excess graphs for T is the set of all simple graphs and multigraphs with i edges, except for the case that T is a 5-star, for which the graph formed by four multiple edges is not achievable when n = 12.