Snapshot disjointness in temporal graphs

DOI10.1016/J.TCS.2024.114690MaRDI QIDQ6589845FDOQ6589845

Authors: Allen Ibiapina, Ana Silva 

Publication date: 20 August 2024

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

zbMATH Keywords

Menger's theoremtemporal graphssnapshot disjointness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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)