On computing the diameter of (weighted) link streams

DOI10.4230/LIPICS.SEA.2021.11MaRDI QIDQ6159898zbMATH OpenFDO

Authors Pilu Crescenzi, Andrea Marino

Publication date 23 June 2023

zbMATH Keywords

diametershortest pathtemporal graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On Computing the Diameter of (Weighted) Link Streams
• On computing the diameter of real-world undirected graphs
• Computing Betweenness Centrality in Link Streams
• Temporal matching
• Computing giant graph diameters

Cited in

(3)

• Blackout-tolerant temporal spanners
• Blackout-tolerant temporal spanners
• On Computing the Diameter of (Weighted) Link Streams

This page was built for publication: On computing the diameter of (weighted) link streams

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