Least-time and minimum-hop delayed-paths in clustered temporal networks
Thomas F. Hain · 1992
A formalization of Temporal Graph (an abstraction of Low Altitude Multiple Satellite (LAMS) networks), in which edges are created and destroyed according to a predefined schedule, is presented. Relative to this framework, the notions of delayed-path and clustered temporal networks are introduced. A system of data structures and algorithms is developed for the generation, within such networks, of delayed-paths meeting a variety of combinations of objectives (such as shortest delivery time and minimum hop count), and an analysis is given for each of the algorithms.