Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Saitoh, Toshiki"'
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the numbers of
Externí odkaz:
http://arxiv.org/abs/2212.07119
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
Publikováno v:
In Theoretical Computer Science 1 July 2024 1003
Autor:
Shiota, Takumi, Saitoh, Toshiki
Publikováno v:
In Theoretical Computer Science 29 June 2024 1002
For a graph class $\mathcal{C}$, the $\mathcal{C}$-Edge-Deletion problem asks for a given graph $G$ to delete the minimum number of edges from $G$ in order to obtain a graph in $\mathcal{C}$. We study the $\mathcal{C}$-Edge-Deletion problem for $\mat
Externí odkaz:
http://arxiv.org/abs/2007.03859
Autor:
Ito, Takehiro, Kawahara, Jun, Minato, Shin-ichi, Otachi, Yota, Saitoh, Toshiki, Suzuki, Akira, Uehara, Ryuhei, Uno, Takeaki, Yamanaka, Katsuhisa, Yoshinaka, Ryo
Publikováno v:
In Theoretical Computer Science 2 November 2023 978
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We propose a general method performed over multivalued decision diagrams that enumerates all subgraphs of an input graph that are characterized by input forbidden induced subgraphs. Our method combines elaborations of classical set operations and the
Externí odkaz:
http://arxiv.org/abs/1804.03822
Autor:
Yamanaka, Katsuhisa, Horiyama, Takashi, Keil, J. Mark, Kirkpatrick, David, Otachi, Yota, Saitoh, Toshiki, Uehara, Ryuhei, Uno, Yushi
We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number
Externí odkaz:
http://arxiv.org/abs/1803.06816
The problems of Permutation Routing via Matching and Token Swapping are reconfiguration problems on graphs. This paper is concerned with the complexity of those problems and a colored variant. For a given graph where each vertex has a unique token on
Externí odkaz:
http://arxiv.org/abs/1612.02948