Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Kunihiro Wasa"'
Autor:
Kunihiro Wasa, Shin Nishio, Koki Suetsugu, Michael Hanks, Ashley Stephens, Yu Yokoi, Kae Nemoto
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 4, Pp 1-7 (2023)
Large-scale quantum information processing requires the use of quantum error-correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates, as they can be imp
Externí odkaz:
https://doaj.org/article/fbcc9b36b0f84042b35a5ec3a662d6c0
Autor:
Ryosuke Shibukawa, Shoichi Ishida, Kazuki Yoshizoe, Kunihiro Wasa, Kiyosei Takasu, Yasushi Okuno, Kei Terayama, Koji Tsuda
Publikováno v:
Journal of Cheminformatics, Vol 12, Iss 1, Pp 1-14 (2020)
Abstract In computer-assisted synthesis planning (CASP) programs, providing as many chemical synthetic routes as possible is essential for considering optimal and alternative routes in a chemical reaction network. As the majority of CASP programs hav
Externí odkaz:
https://doaj.org/article/9fd579bf7a8c40d186f506df7b91a401
Autor:
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c804d18026920620e16c2e29a867c7bf
https://doi.org/10.1007/s00453-023-01117-z
https://doi.org/10.1007/s00453-023-01117-z
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2021, 303, pp.237-252. ⟨10.1016/j.dam.2020.05.027⟩
Discrete Applied Mathematics, 2021, 303, pp.237-252. ⟨10.1016/j.dam.2020.05.027⟩
Finding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and many community models have been pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81c8a20c15e0ce98e5171788e3284216
https://doi.org/10.1016/j.dam.2020.05.027
https://doi.org/10.1016/j.dam.2020.05.027
Autor:
Takeaki Uno, Akira Suzuki, Toshiki Saitoh, Takashi Horiyama, Koki Suetsugu, Shin-ichi Nakano, Ryuhei Uehara, Kunihiro Wasa
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1101-1107
Given a set P of n points on which facilities can be placed and an integer k, we want to place k facilities on some points so that the minimum distance between facilities is maximized. The problem is called the k-dispersion problem. In this paper we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0297d7fcb76fe477ab661dd17dbd85b6
https://doi.org/10.1587/transfun.2020dmp0003
https://doi.org/10.1587/transfun.2020dmp0003
Autor:
Takehiro Ito, Yusuke Kobayashi, Marthe Bonamy, Marc Heinrich, Akira Suzuki, Haruka Mizuta, Moritz Mühlenthaler, Kunihiro Wasa
Publikováno v:
Theoretical Computer Science. 838:45-57
Given a k-coloring of a graph G, a Kempe-change for two colors a and b produces another k-coloring of G, as follows: first choose a connected component in the subgraph of G induced by the two color classes of a and b, and then swap the colors a and b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2453e6ad97240ff508d51e540406cb3
https://doi.org/10.1016/j.tcs.2020.05.033
https://doi.org/10.1016/j.tcs.2020.05.033
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f92532d8afa412c24756e23ffeb65000
https://doi.org/10.1007/978-3-030-96731-4_4
https://doi.org/10.1007/978-3-030-96731-4_4
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b540ba5155a27b6fda306113e2a7ff9
https://doi.org/10.1007/978-3-031-15914-5_25
https://doi.org/10.1007/978-3-031-15914-5_25
Publikováno v:
IEICE Transactions on Information and Systems. :464-469
A reconfiguration problem asks when we are given two feasible solutions A and B, whether there exists a reconfiguration sequence \((A_0 = A, A_1, \dots , A_\ell = B)\) such that (i) \(A_0, \dots , A_\ell \) are feasible solutions and (ii) we can obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb21fd9fe7c6a1caf18241e96313551c
https://doi.org/10.1587/transinf.2018fcp0010
https://doi.org/10.1587/transinf.2018fcp0010
Autor:
Kazuhiro Kurita, Kunihiro Wasa
In this paper, we consider enumeration problems for edge-distinct and vertex-distinct Eulerian trails. Here, two Eulerian trails are \emph{edge-distinct} if the edge sequences are not identical, and they are \emph{vertex-distinct} if the vertex seque
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0439170fe57844088fd7384f998057d3
http://arxiv.org/abs/2101.10473
http://arxiv.org/abs/2101.10473