31 resultados para Shadow and Highlight Invariant Algorithm.
Filtro por publicador
- Abertay Research Collections - Abertay University’s repository (3)
- Academic Research Repository at Institute of Developing Economies (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 (13)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (3)
- Archive of European Integration (1)
- Aston University Research Archive (31)
- Biblioteca de Teses e Dissertações da USP (4)
- 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) (31)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (64)
- Brock University, Canada (10)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (7)
- CaltechTHESIS (1)
- CentAUR: Central Archive University of Reading - UK (88)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Cochin University of Science & Technology (CUSAT), India (6)
- Coffee Science - Universidade Federal de Lavras (3)
- Collection Of Biostatistics Research Archive (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (4)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (29)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (6)
- Digital Commons - Michigan Tech (5)
- Digital Commons at Florida International University (8)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (11)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (22)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Glasgow Theses Service (1)
- Institute of Public Health in Ireland, Ireland (7)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (15)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (3)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- National Center for Biotechnology Information - NCBI (9)
- Nottingham eTheses (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (9)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (8)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (9)
- Repositório da Produção Científica e Intelectual da Unicamp (3)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (13)
- REPOSITORIO DIGITAL IMARPE - INSTITUTO DEL MAR DEL PERÚ, Peru (1)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (110)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (12)
- Scielo Saúde Pública - SP (18)
- Universidad de Alicante (6)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (43)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade do Minho (8)
- Universidade Federal do Pará (11)
- Universidade Federal do Rio Grande do Norte (UFRN) (27)
- Universidade Metodista de São Paulo (4)
- Universita di Parma (1)
- Universitat de Girona, Spain (2)
- Université de Lausanne, Switzerland (78)
- Université de Montréal (1)
- Université de Montréal, Canada (22)
- University of Canberra Research Repository - Australia (1)
- University of Connecticut - USA (1)
- University of Michigan (1)
- University of Queensland eSpace - Australia (34)
- University of Washington (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009