Hiraku Morimoto

collaborators

2 papers

cs.DS2026

On the Complexity of Forcing and Anti-Forcing Minimum Cuts

Tatsuya Gima, Yasuaki Kobayashi, Hiraku Morimoto +1

For an instance of a combinatorial optimization problem, a \emph{forcing set} is a set of elements such that there is a unique optimal solution including it. Symmetrically, an \emp…

math.CO2026

Treewidth of the $n \times n$ toroidal grid

Tatsuya Gima, Hiraku Morimoto, Yuto Okada +1

In this paper, we show that the treewidth of the $n \times n$ toroidal grid is $2 n - 1$ for all $n \geq 5$ . This closes the gap between the previously known upper bound of $2 n - 1$ (Ell…

On the Complexity of Forcing and Anti-Forcing Minimum Cuts

Treewidth of the n×n toroidal grid

Treewidth of the $n \times n$ toroidal grid