Snapshot disjointness in temporal graphs

DOI10.1016/J.TCS.2024.114690MaRDI QIDQ6589845zbMATH OpenFDO

Authors Allen Ibiapina, Ana Silva

Publication date 20 August 2024

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

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

zbMATH Keywords

Menger's theoremsnapshot disjointnesstemporal graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Assigning times to minimise reachability in temporal graphs
• Coloring temporal graphs
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Finding Temporal Paths Under Waiting Time Constraints.
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• scientific article; zbMATH DE number 961960 (Why is no real title available?)
• Length-bounded cuts and flows
• Mengerian graphs: characterization and recognition
• Parameterized algorithms
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• Temporal network optimization subject to connectivity constraints
• The complexity of finding maximum disjoint paths with length constraints
• The complexity of finding small separators in temporal graphs
• The complexity of finding two disjoint paths with min-max objective function

This page was built for publication: Snapshot disjointness in temporal graphs

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