Zobrazeno 1 - 10
of 205
pro vyhledávání: '"Toru ARAKI"'
Autor:
Naoko Okamoto, Masanori Ikeda, Masato Okuda, Tomoko Sakamoto, Mizue Takasugi, Nobumasa Takahashi, Toru Araki, Tsuneo Morishima, Kozo Yasui
Publikováno v:
Allergology International, Vol 60, Iss 4, Pp 467-472 (2011)
Background: Respiratory syncytial virus (RSV) is a major respiratory pathogen which causes bronchiolitis with dyspnea and wheezing in children less than 2 years old. RSV bronchiolitis in infancy severe enough to cause hospitalization might be a risk
Externí odkaz:
https://doaj.org/article/5dd6baeb04364c318146e1b77637f990
Autor:
Toru Araki, Ryuya Saito
Publikováno v:
Discrete Applied Mathematics. 334:139-144
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::150f08ed8e1e00d28d95b7702d3c5ecc
https://doi.org/10.1016/j.dam.2023.04.002
https://doi.org/10.1016/j.dam.2023.04.002
Publikováno v:
Nihon Chikusan Gakkaiho. 93:105-111
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::691e3b900da9412c274d6a40e487b398
https://doi.org/10.2508/chikusan.93.105
https://doi.org/10.2508/chikusan.93.105
Autor:
Toru Araki, Kosuke Nakamura
Publikováno v:
Discrete Applied Mathematics. 285:43-54
For a connected graph, it is known that there exists a partition of the vertex set into two dominating sets of the graph. However, for a digraph, there does not always exist such partition of the vertex set. We consider the problem of determining whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfc253ff1cf78a9c6fbc406d6b74585d
https://doi.org/10.1016/j.dam.2020.05.021
https://doi.org/10.1016/j.dam.2020.05.021
Publikováno v:
Journal of Interconnection Networks. 22
The minimum stretch spanning tree problem for a connected graph [Formula: see text] is to find a spanning tree [Formula: see text] of [Formula: see text] such that the maximum distance in [Formula: see text] between two adjacent vertices of [Formula:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87821c325d28e7cfcc40e7665c0bd2e7
https://doi.org/10.1142/s0219265921500286
https://doi.org/10.1142/s0219265921500286
Autor:
Ryo Yamanaka, Toru Araki
Publikováno v:
Discrete Applied Mathematics. 262:179-184
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex u ⁄ ∈ S , there is a vertex v ∈ S such that u v is an edge and ( S ∖ { v } ) ∪ { u } is also a dominating set of G . The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::894325c52e399b16b27adedde425de82
https://doi.org/10.1016/j.dam.2019.02.043
https://doi.org/10.1016/j.dam.2019.02.043
Autor:
Hiroka Miyazaki, Toru Araki
Publikováno v:
Discrete Applied Mathematics. 247:70-76
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex u ∉ S , there is a vertex v ∈ S such that u v is an edge and ( S ∖ { v } ) ∪ { u } is also a dominating set of G . The secu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eee7f6fc7204d774eb62c9a016b950d9
https://doi.org/10.1016/j.dam.2018.03.040
https://doi.org/10.1016/j.dam.2018.03.040
Autor:
Toru Araki, Issei Yumoto
Publikováno v:
Discrete Applied Mathematics. 236:23-29
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex uS, there is a vertex vS such that uv is an edge and (S{v}){u} is also a dominating set of G. We show that if G is a maximal outerp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ab3b0ee5e046f39e5c74c8f44e6d415
https://doi.org/10.1016/j.dam.2017.10.020
https://doi.org/10.1016/j.dam.2017.10.020
Autor:
Isao Fujita, Masahiro Sakata, Yoshiko Abe, Jouichiro Horii, Katsunori Matsueda, Tatsuya Toyokawa, Toru Araki
Publikováno v:
Internal Medicine
A 1-year-old female toddler who was under a great amount of psychological stress presented with acute hematemesis. She had no significant medical history; she displayed lethargy and was anemic. Although blood transfusion and famotidine were administe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7266587b3aa5f66c845edcbd4771f85e
https://pubmed.ncbi.nlm.nih.gov/29780141
https://pubmed.ncbi.nlm.nih.gov/29780141
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1192-1199
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::047708c43ec3cf42c30261b72f1e0fbe
https://doi.org/10.1587/transfun.e97.a.1192
https://doi.org/10.1587/transfun.e97.a.1192