On computing optimal temporal branchings

DOI10.1007/978-3-031-43587-4_8MaRDI QIDQ6546587

Daniela Bubboloni, Andrea Marino, Ana Silva, Costanza Catalano

Publication date: 29 May 2024

zbMATH Keywords

temporal networktemporal graphlink streamoptimal branchingoptimal temporal walk

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Related Items (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)