Yuichi Yoshida

collaborators

2 papers

cs.DS2025

Courcelle's Theorem for Lipschitz Continuity

Tatsuya Gima, Soh Kumabe, Yuichi Yoshida

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lips…

math.CO2025

The minimum number of vertices and edges of connected graphs with ind-match $(G) = p$ , min-match $(G) = q$ and match $(G) = r$

Kazunori Matsuda, Ryosuke Sato, Yuichi Yoshida

Let ind-match $(G)$ , min-match $(G)$ and match $(G)$ denote the induced matching number, minimum matching number and matching number of a graph $G$ , respectively. It is known that ind…

Courcelle's Theorem for Lipschitz Continuity

The minimum number of vertices and edges of connected graphs with ind-match(G)=p, min-match(G)=q and match(G)=r

The minimum number of vertices and edges of connected graphs with ind-match $(G) = p$ , min-match $(G) = q$ and match $(G) = r$