Zobrazeno 1 - 10
of 70
pro vyhledávání: '"I, Oshiro"'
Autor:
R. Franko, Y. Franko, E. Ribes Martinez, G. A. Ferronato, I. Heinzelmann, N. Grechi, S. Devkota, P. K. Fontes, R. Coeti, T. S. I. Oshiro, M. A. M. M. Ferraz
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-14 (2024)
Abstract Understanding the mechanical properties and porosity of reproductive tissues is vital for regenerative medicine and tissue engineering. This study investigated the changes in Young's modulus (YM), storage modulus (E′), loss modulus (Eʺ),
Externí odkaz:
https://doaj.org/article/89e477aa49fc483a84fdb5a774129023
Publikováno v:
Anais do XLVIII Seminário Integrado de Software e Hardware (SEMISH 2021).
This paper explores how Natural Language Processing techniques can be integrated to solve real-world problems in the e-commerce scenario. We address the issue of having high quality information products offered to customers in a marketplace platform,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a9497f1ae0dd680037779471e0a342c
https://doi.org/10.5753/semish.2021.15835
https://doi.org/10.5753/semish.2021.15835
Publikováno v:
Discrete Applied Mathematics. 245:128-138
Barat and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number k T such that, if G is a k T -edge-connected graph and | E ( G ) | is divisible by | E ( T ) | , then G admits a decomposition in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bda69688f0e42d8423fffb1b25e01032
https://doi.org/10.1016/j.dam.2016.08.001
https://doi.org/10.1016/j.dam.2016.08.001
Publikováno v:
European Journal of Combinatorics. 66:28-36
A P l -decomposition of a graph G is a set of pairwise edge-disjoint paths with l edges that cover the edge set of G . In 1957, Kotzig proved that a 3 -regular graph admits a P 3 -decomposition if and only if it contains a perfect matching, and also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::450f8a8f1dd84d0f0248a4e861fdf819
https://doi.org/10.1016/j.ejc.2017.06.011
https://doi.org/10.1016/j.ejc.2017.06.011
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two classical quality
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b4fea56ac30df1c88b0de1448e340e0
https://doi.org/10.1016/j.tcs.2016.05.020
https://doi.org/10.1016/j.tcs.2016.05.020
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:53-58
The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, and the initial position and velocity of n points, find an optimal k-clustering of the points. We consider two classical quality
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::534f91b5c9c2404254bff9d3bac27ff8
https://doi.org/10.1016/j.endm.2015.07.010
https://doi.org/10.1016/j.endm.2015.07.010
Publikováno v:
Electronic Notes in Discrete Mathematics. 49:795-802
We study the decomposition conjecture posed by Barat and Thomassen (2006), which states that, for each tree T, there exists a natural number k T such that, if G is a k T -edge-connected graph and | E ( T ) | divides | E ( G ) | , then G admits a part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::304af4db1be21154434d6e9483e2df4b
https://doi.org/10.1016/j.endm.2015.06.107
https://doi.org/10.1016/j.endm.2015.06.107
Publikováno v:
Electronic Notes in Discrete Mathematics. 49:629-636
A Pl-decomposition of a graph G is a set of pairwise edge-disjoint paths of G with l edges that cover the edge set of G. Kotzig [Kotzig, A., Aus der Theorie der endlichen regularen Graphen dritten und vierten Grades, Casopis Pěst. Mat. 82 (1957), pp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dda6b7b91cc4b769612a96305448d58
https://doi.org/10.1016/j.endm.2015.06.085
https://doi.org/10.1016/j.endm.2015.06.085
We study the decomposition conjecture posed by Barat and Thomassen (2006), which states that, for each tree T, there exists a natural number kT such that, if G is a kT-edge-connected graph and |E(T)| divides |E(G)|, then G admits a partition of its e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa335ce5485407efcfa46a42192728e2
http://arxiv.org/abs/1505.04309
http://arxiv.org/abs/1505.04309
