Reconfiguring (non-spanning) arborescences

Ito, T; Iwamasa, Y; Kobayashi, Y; Nakahata, Y; Otachi, Y; Wasa, K

Ito, T (通讯作者),Tohoku Univ, Grad Sch Informat Sci, Sendai, Japan.

THEORETICAL COMPUTER SCIENCE, 2023; 943 (): 131

Abstract

In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the......

Full Text Link