Skip to content
Log in
Sponsored Artificial Intelligence: A Modern Approach, Global Edition Artificial Intelligence: A Modern Approach, Global Edition

Author

Yuya Terashima

h-index 0 View on Semantic Scholar

We have 1 of 2 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

NP-Hardness of Connected Components Reconfiguration under Component Jumping on Caterpillar Graphs

It is proved that \CCRCJ~on path graphs is NP-hard even on caterpillar graphs, which is a very restricted subclass of trees and chordal graphs minimally above path graphs, thereby resolving Nakahata's open problem on chordal graphs under multiset size constraints.

Naoki Kitamura, Seitaro Kawaguchi, Yuya Terashima et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.