Haruka Mizuta

activity

20182022

most citedIncremental Optimization of Independent Sets under Reachability Constraints

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi +4

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The e…

cs.DS2020

Reconfiguration of Spanning Trees with Many or Few Leaves

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi +4

Let $G$ be a graph and $T_{1}, T_{2}$ be two spanning trees of $G$ . We say that $T_{1}$ can be transformed into $T_{2}$ via an edge flip if there exist two edges $e \in T_{1}$ and $f$ in $T_2…

cs.DS2018

Reconfiguring spanning and induced subgraphs

Tesshu Hanaka, Takehiro Ito, Haruka Mizuta +5

Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertice…