Independent Set Reconfiguration Under Bounded-Hop Token Jumping
Hiroki Hatano, Naoki Kitamura, Izumi Taisuke, Takehiro Ito et autres
jp (code pays fourni par la source)
Informations fournies par OpenAlex. Research Africa ne déduit ni nationalité, ni poste, ni coordonnées personnelles.
Hiroki Hatano, Naoki Kitamura, Izumi Taisuke, Takehiro Ito et autres
jp (code pays fourni par la source)
Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
jp (code pays fourni par la source)
Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
jp (code pays fourni par la source)
Hiroki Hatano, Naoki Kitamura, Izumi Taisuke, Takehiro Ito et autres
The independent set reconfiguration problem (ISReconf) is the problem of determining, for given independent sets I_s and I_t of a graph G, whether I_s can be transformed into I_t by repeatedly applying a prescribed reconfiguration rule that transforms an independent set to …
Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Thinh Van Nguyen, T. Ozaki, Akihiko Wakai, Takashi Kimura et autres
Abstract Every year, many typhoons make landfall in Japan causing disasters on mountain slopes across the country. Rainfall induced landslides in Japan mostly occur at shallow depths. Developing simple models of rainfall-induced landslides provides a practical alternative to finite element methods in …
vn, jp (code pays fourni par la source)
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
We investigated the computational power of a single mobile agent in an $n$-node graph with storage (i.e., node memory). Generally, a system with one-bit agent memory and $O(1)$-bit storage is as powerful as that with $O(n)$-bit agent memory and $O(1)$-bit storage. Thus, …
Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura et autres
We investigate the computational power of the deterministic single-agent model where the agent and each node are equipped with a limited amount of persistent memory. Tasks are formalized as decision problems on properties of input graphs, i.e., the task is defined as …
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutions in low-treewidth graphs. By ``efficient'' we mean that the running time has polynomial dependence …
Satoshi Matsunaga, Ken-ichi Hasada, Kenji Sugiura, Naoki Kitamura et autres
Abstract We have successfully synthesized rhodium-containing MOFs with 1:1 abundance ratios of paddle-wheel units of Rh2 and Cu2/Zn2, i.e., [Rh2M2(1,4-bdc)4]·nSolvent (M = Cu: RhCu-DMF, RhCu-EtOH; M = Zn: RhZn-DMF; 1,4-bdc: 1,4-benzenedicarboxylate) by a novel synthetic method involving assembly of discrete paddle-wheel dirhodium(II) …
jp (code pays fourni par la source)
智博 木村, 清道 青山, 直樹 北村, 大輔 深澤 et autres
Since Hyogo-Ken Nambu(Kobe) Earthquake, disaster mitigation including countermeasures for aged people and disabled are pervaded profoundly among municipal governments in Japan. Related to disaster mitigation considering with aged people and disabled are studied and discussed by researchers, engineers and administrators. In this …
智博 木村, 清道 青山, 直樹 北村, 大輔 深澤 et autres
In this chapter, we conducted questionnaire survey for municipal governments in Niigata Prefecture in frenzy efforts to find various solutions such as evacuation system and improve countermeasure for aged people. In addition to that, we investigated disaster prevention for regional plan. Few …
BNTIC News n’est pas le producteur de ces données. Les publications sont interrogées à la demande dans Crossref, OpenAIRE, DOAJ, Europe PMC, HAL, DataCite, AfricArXiv, ROR et la Banque mondiale, sans clé d’accès. OpenAlex reste optionnel. Aucun service payant n’est nécessaire et aucune donnée externe n’est enregistrée en base. Consulter les sources et leurs limites.
L'essentiel de l'actu tech du Burkina & d'Afrique, chaque semaine dans votre boîte mail.
Gratuit · sans spam · désinscription en un clic