T. Hanaka

activity

20182026

most citedComputing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study

3 citations · 3 across the 25 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

2 papers · 2 filters

math.CO2024

Basis sequence reconfiguration in the union of matroids

Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2

Given a graph $G$ and two spanning trees $T$ and $T^{'}$ in $G$ , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from $T$ to $T^{'}$ such that all inter…

math.CO2024

An improved spectral lower bound of treewidth

Tatsuya Gima, Tesshu Hanaka, Kohei Noro +2

We show that for every $n$ -vertex graph with at least one edge, its treewidth is greater than or equal to $n λ_{2} / (Δ + λ_{2}) - 1$ , where $Δ$ and $λ_{2}$ are the maximum degree a…