This page focuses on temporal spanning trees, also referred to as multicast trees. Such a spanning tree does not exist in every temporal graph!
Multicast trees are temporal subgraphs with a tree as footprint, typically rooted in a single source, and designed to reach all other vertices. Research in this area primarily aims to compute such a subgraph if it exists under various optimization objectives, including earliest arrival, minimum total weight, or bounded latency. It explores their computational complexity and algorithmic properties in different temporal graph settings.