Takehiro Ito

activity

20152023

most citedComplexity of Reconfiguration Problems for Constraint Satisfaction

5 citations · 13 across the 10 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Fixed-Parameter Algorithms for Graph Constraint Logic

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito +3

Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL captures \PSPACE\xsp…

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…