The gathering problem requires multiple mobile agents in a network to meet at a single location. This paper investigates the gathering problem in carrier graphs, a subclass of recurrence of edge class of time-varying graphs.
By focusing on three subclasses of single carrier graphs - circular, simple, and arbitrary - we clarify the conditions under which the problem can be solved. We propose algorithms for solvable cases and analyze the complexities. We also propose an algorithm for carrier graphs with multiple carriers.