Zobrazeno 1 - 10
of 3 108
pro vyhledávání: '"Suzuki, Akira"'
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$. It is known that $\mathrm{Hom}(G,H)$ is homotopy equivalent to a disjoint union of points and circles when
Externí odkaz:
http://arxiv.org/abs/2408.04802
In the last decade, algorithmic frameworks based on a structural graph parameter called mim-width have been developed to solve generally NP-hard problems. However, it is known that the frameworks cannot be applied to the Clique problem, and the compl
Externí odkaz:
http://arxiv.org/abs/2405.15492
Autor:
Gima, Tatsuya, Hanaka, Tesshu, Kobayashi, Yasuaki, Otachi, Yota, Shirai, Tomohito, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao
The problem of packing as many subgraphs isomorphic to $H \in \mathcal H$ as possible in a graph for a class $\mathcal H$ of graphs is well studied in the literature. Both vertex-disjoint and edge-disjoint versions are known to be NP-complete for $H$
Externí odkaz:
http://arxiv.org/abs/2312.08639
Autor:
Ito, Takehiro, Iwamasa, Yuni, Kamiyama, Naoyuki, Kobayashi, Yasuaki, Kobayashi, Yusuke, Maezawa, Shun-ichi, Suzuki, Akira
An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is one of the most fundamental combinatorial objects in a digraph. In this paper, we study arborescences in digraphs from the viewpoint of combinatorial reconfig
Externí odkaz:
http://arxiv.org/abs/2305.07262
Autor:
Ito, Takehiro, Kawahara, Jun, Nakahata, Yu, Soh, Takehide, Suzuki, Akira, Teruyama, Junichi, Toda, Takahisa
This paper proposes an algorithmic framework for various reconfiguration problems using zero-suppressed binary decision diagrams (ZDDs), a data structure for families of sets. In general, a reconfiguration problem checks if there is a step-by-step tr
Externí odkaz:
http://arxiv.org/abs/2207.13959
Autor:
Ba, Yunhao, Zhang, Howard, Yang, Ethan, Suzuki, Akira, Pfahnl, Arnold, Chandrappa, Chethan Chinder, de Melo, Celso, You, Suya, Soatto, Stefano, Wong, Alex, Kadambi, Achuta
We propose a large-scale dataset of real-world rainy and clean image pairs and a method to remove degradations, induced by rain streaks and rain accumulation, from the image. As there exists no real-world dataset for deraining, current state-of-the-a
Externí odkaz:
http://arxiv.org/abs/2206.10779
Autor:
Ito, Takehiro, Kawahara, Jun, Minato, Shin-ichi, Otachi, Yota, Saitoh, Toshiki, Suzuki, Akira, Uehara, Ryuhei, Uno, Takeaki, Yamanaka, Katsuhisa, Yoshinaka, Ryo
Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins. These puzzles
Externí odkaz:
http://arxiv.org/abs/2202.09495
Autor:
Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro
We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a t
Externí odkaz:
http://arxiv.org/abs/2201.04354
Autor:
Suzuki, Akira, Yabuta, Norikazu, Shimada, Keisuke, Mashiko, Daisuke, Tokuhiro, Keizo, Oyama, Yuki, Miyata, Haruhiko, Garcia, Thomas X., Matzuk, Martin M., Ikawa, Masahito
Publikováno v:
In Journal of Reproductive Immunology June 2024 163
Autor:
Foppiano, Luca, Dieb, Sae, Suzuki, Akira, de Castro, Pedro Baptista, Iwasaki, Suguru, Uzuki, Azusa, Echevarria, Miren Garbine Esparza, Meng, Yan, Terashima, Kensei, Romary, Laurent, Takano, Yoshihiko, Ishii, Masashi
Publikováno v:
STAM:M, 2021, VOL. 1, NO. 1, 34-44
A growing number of papers are published in the area of superconducting materials science. However, novel text and data mining (TDM) processes are still needed to efficiently access and exploit this accumulated knowledge, paving the way towards data-
Externí odkaz:
http://arxiv.org/abs/2101.02455