8 citations · 15 across the 10 of their papers we have counts for
6 papers · 1 filter
Finding Order-Preserving Subgraphs
Haruya Imamura, Yasuaki Kobayashi, Yota Otachi +5
(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-seri…
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda +2
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 searc…
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
For a graph class , the -Edge-Deletion problem asks for a given graph to delete the minimum number of edges from in order to obtain a graph in $\m…
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki +1
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…
Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil +5
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 ca…
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phyloge…