Hiroaki Mori

collaborators

2 papers

cs.DS2026

EPTAS for Hard Graph Cut Problems for Dense Graphs

Kaisei Deguchi, Ken-ichi Kawarabayashi, Hiroaki Mori

Everywhere- $I^´$ -dense graphs are defined as graphs on $n$ vertices in which every vertex has degree at least $I^´ n$ for some constant $I^´ > 0$ . Approximation schemes are vital for ha…

math.CO2026

The exact value of $c_{1} (K_{2, n})$

Hiroaki Mori

For a graph $G$ , let $c_{1} (G)$ be the largest distortion necessary to embed any shortest-path metric on $G$ into $ℓ_{1}$ , and for any natural number $n, m \in N$ , denote $K_{…

EPTAS for Hard Graph Cut Problems for Dense Graphs

The exact value of c1​(K2,n​)

The exact value of $c_{1} (K_{2, n})$