Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Cristina López-Ramírez"'
Autor:
Wiliam Aguilar-Baldosea, Isabel Cristina López- Ramírez, Leydi Yhona Chávez- Mosquera, Leyser Rengifo Murillo, Julio Cesar Halaby- Guerrero
Publikováno v:
Revista Politécnica, Vol 18, Iss 35, Pp 9-23 (2022)
Los ecosistemas de humedales de la cuenca media del Atrato se han visto afectados por factores como la minería, que interrumpen la dinámica ecológica natural de estas comunidades acuáticas entre ellas el ensamblaje de macroinvertebrados acuático
Externí odkaz:
https://doaj.org/article/371f842f190b4631aebf0db31e75b2a6
Publikováno v:
Dyna, Vol 86, Iss 208, Pp 214-220 (2019)
Transpiration is a key variable in water balance. Sap flow measurement methods allow to estimate transpiration at plant level, but scalable at the stand, river basin or ecosystem level. This requires recording data continuously, for which there are c
Externí odkaz:
https://doaj.org/article/9ee649154ead4d2aa9f73dd23770a190
Autor:
Aguilar-Baldosea, Wiliam1, Cristina López-Ramírez, Isabel2, Yhona Chávez-Mosquera, Leydi2, Rengifo Murillo, Leyser3 leyserrengifo123@gmail.com, Cesar Halaby-Guerrero, Julio1
Publikováno v:
Revista Politécnica. ene-jun2022, Vol. 18 Issue 35, p9-23. 15p.
Autor:
Jesús Francisco Perez-Gomez, Juana Canul-Reich, Rafael Rivera-Lopez, Betania Hernández Ocaña, Cristina López-Ramírez
Publikováno v:
Proceedings of the International Conference on Paradigms of Computing, Communication and Data Sciences ISBN: 9789811987410
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d327de5459ff68eaa93c4b1287994e4
https://doi.org/10.1007/978-981-19-8742-7_41
https://doi.org/10.1007/978-981-19-8742-7_41
Publikováno v:
Electronic Notes in Theoretical Computer Science. 354:75-89
We analyze the vertex-coloring problem restricted to planar graphs and propose to consider classic wheels and polyhedral wheels as basic patterns for the planar graphs. We analyze the colorability of the composition among wheels and introduce a novel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfef798053b1a5aa346d7574390aad3f
https://doi.org/10.1016/j.entcs.2020.10.007
https://doi.org/10.1016/j.entcs.2020.10.007
Autor:
Jorge E. Gutiérrez-Gómez, Ana E. De Ita-Varela, Guillermo De Ita Luna, Cristina López-Ramírez
Publikováno v:
Electronic Notes in Theoretical Computer Science. 354:91-105
We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set S of the input graph. The maximal independent set S must fulfill certain characteristics. For example, S contains the vertex that appears
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9741ee4876280782dcf5b69c6826b75a
https://doi.org/10.1016/j.entcs.2020.10.008
https://doi.org/10.1016/j.entcs.2020.10.008
Publikováno v:
Dyna, Vol 86, Iss 208, Pp 214-220 (2019)
DYNA, Volume: 86, Issue: 208, Pages: 213-220, Published: MAR 2019
DYNA, Volume: 86, Issue: 208, Pages: 213-220, Published: MAR 2019
Transpiration is a key variable in water balance. Sap flow measurement methods allow to estimate transpiration at plant level, but scalable at the forest stand, river basin or ecosystem level. This requires recording data continuously, for which ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2e5549c7e8a585877f45c82f65fc3ee
https://revistas.unal.edu.co/index.php/dyna/article/view/72039
https://revistas.unal.edu.co/index.php/dyna/article/view/72039
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030210762
MCPR
MCPR
We recognize the wheel graphs with different kinds of centers or axle faces as the basic pattern forming a planar graph. We focus on the analysis of the vertex-coloring for these graphic patterns, and identify cases for the 3 or 4 colorability of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::517dbdb4b7a7e580ee46689cf5a1fcfe
https://doi.org/10.1007/978-3-030-21077-9_31
https://doi.org/10.1007/978-3-030-21077-9_31
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319921976
MCPR
MCPR
A novel method to model the 3-coloring on polygonal tree graphs is presented. This proposal is based on the logical specification of the constraints generated for a valid 3-coloring on polygonal graphs. In order to maintain a polynomial time procedur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3017ea891168795f279c4adb26e65b8
https://doi.org/10.1007/978-3-319-92198-3_10
https://doi.org/10.1007/978-3-319-92198-3_10