Finding a minimum source set in temporal graphs

DOI10.1016/J.TCS.2025.115624MaRDI QIDQ6884341zbMATH OpenFDO

Authors Saksham Yadav, Priyanshu Sharma, Siddhartha Gaur, Srinibas Swain, Subhrangsu Mandal

Publication date 15 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115624

zbMATH Keywords

dynamic graphsminimum source setsource settemporal graphstemporal source settemporal tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cites work

• Assigning times to minimise reachability in temporal graphs
• Complexity of approximating bounded variants of optimization problems
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Convergecast tree on temporal graphs
• Finding temporal paths under waiting time constraints
• Maximum 0-1 timed matching on temporal graphs
• Mengerian temporal graphs revisited
• On short fastest paths in temporal graphs
• Optimizing reachability sets in temporal graphs by delaying
• Shortest, fastest, and foremost broadcast in dynamic networks
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Temporal Reachability Minimization: Delaying vs. Deleting

This page was built for publication: Finding a minimum source set in temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884341)