Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Masaaki Kanzaki"'
Publikováno v:
HortScience, Vol 59, Iss 9 (2024)
Improving the productivity of sweet pepper (Capsicum annuum) is essential to meeting the increasing global demand. This can be partially accomplished by investigating and determining high-yield traits, thereby enabling the selection or breeding of hi
Externí odkaz:
https://doaj.org/article/fca2ac5e1b434d37b919ea3d629a6db3
Autor:
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Publikováno v:
Algorithmica. 84:871-895
Given a graph $$G = (V,E)$$ G = ( V , E ) , $$A \subseteq V$$ A ⊆ V , and integers k and $$\ell $$ ℓ , the $$(A,\ell )$$ ( A , ℓ ) -Path Packing problem asks to find k vertex-disjoint paths of length exactly $$\ell $$ ℓ that have endpoints in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b0e3966aa3bca95111d9d6a5f9d6970
https://doi.org/10.1007/s00453-021-00875-y
https://doi.org/10.1007/s00453-021-00875-y
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f69dfb258b37f18051e78637c2a984ad
https://doi.org/10.2139/ssrn.4049750
https://doi.org/10.2139/ssrn.4049750
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. In these problems, some tokens are placed on a subset of vertices of the graph, and there are three natural reconfigur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57b5d842a98197a2b47ff3d901999bb8
https://doi.org/10.1007/978-3-030-89543-3_54
https://doi.org/10.1007/978-3-030-89543-3_54
Autor:
Yota Otachi, Hirotaka Ono, Yasuaki Kobayashi, Michael Lampis, Yusuke Kobayashi, Masaaki Kanzaki, Masashi Kiyomi, Tesshu Hanaka, Rémy Belmonte
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
IWOCA
Given a graph \(G = (V,E)\), \(A \subseteq V\), and integers k and \(\ell \), the \((A,\ell )\) -Path Packing problem asks to find k vertex-disjoint paths of length \(\ell \) that have endpoints in A and internal points in \(V \setminus A\). We study
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab342f83dbc5fa5937db16a25b2da02a
https://doi.org/10.1007/978-3-030-48966-3_4
https://doi.org/10.1007/978-3-030-48966-3_4