21 citations · 62 across the 20 of their papers we have counts for
4 papers · 1 filter
Reconfiguration of Regular Induced Subgraphs
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi +2
We study the problem of checking the existence of a step-by-step transformation of -regular induced subgraphs in a graph, where and each step in the transformation mus…
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi +3
In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem of reconfiguring arbo…
Polynomial-Delay Enumeration of Large Maximal Matchings
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Enumerating matchings is a classical problem in the field of enumeration algorithms. There are polynomial-delay enumeration algorithms for several settings, such as enumerating per…
Constant Amortized Time Enumeration of Eulerian trails
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…