Hiroshi Eto

collaborators

2 papers

cs.DS2020

Computing the Largest Bond and the Maximum Connected Cut of a Graph

Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka +6

The cut-set $\partial (S)$ of a graph $G = (V, E)$ is the set of edges that have one endpoint in $S \subset V$ and the other endpoint in $V ∖ S$ , and whenever $G [S]$ is connected…

cs.DS2019

Parameterized Algorithms for Maximum Cut with Connectivity Constraints

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi +1

We study two variants of \textsc{Maximum Cut}, which we call \textsc{Connected Maximum Cut} and \textsc{Maximum Minimal Cut}, in this paper. In these problems, given an unweighted…