On computing optimal temporal branchings

DOI10.1007/978-3-031-43587-4_8MaRDI QIDQ6546587zbMATH OpenFDO

Authors Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43587-4_8

zbMATH Keywords

link streamoptimal branchingoptimal temporal walktemporal graphtemporal network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Anomaly detection in dynamic networks: a survey
• Components in time-varying graphs
• Connection Scan Algorithm
• Edge-Disjoint Branchings in Temporal Graphs
• Eulerian walks in temporal graphs
• scientific article; zbMATH DE number 3489106 (Why is no real title available?)
• Introduction to algorithms
• On Computing the Diameter of (Weighted) Link Streams
• On packing arborescences in temporal networks
• Optimizing reachability sets in temporal graphs by delaying
• The complexity of finding small separators in temporal graphs
• The complexity of theorem-proving procedures

Cited in

(1)

• On computing optimal temporal branchings and spanning subgraphs

This page was built for publication: On computing optimal temporal branchings

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