On computing optimal temporal branchings and spanning subgraphs
DOI10.1016/j.jcss.2024.103596MaRDI QIDQ6655668
Costanza Catalano, Andrea Marino, Ana Silva, Daniela Bubboloni
Publication date: 27 December 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
temporal networktemporal graphoptimal branchingoptimal temporal walktemporal branchingtemporal spanning subgraph
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- On packing arborescences in temporal networks
- Discrete mathematics
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Temporal network optimization subject to connectivity constraints
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders
- The complexity of optimal design of temporally connected graphs
- Temporal flows in temporal networks
- 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
- Contrasting the Spread of Misinformation in Online Social Networks
- The complexity of theorem-proving procedures
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Connectivity and inference problems for temporal networks
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- On Computing the Diameter of (Weighted) Link Streams
- On computing optimal temporal branchings
- Anomaly detection in dynamic networks: a survey
This page was built for publication: On computing optimal temporal branchings and spanning subgraphs
