On Computing the Diameter of (Weighted) Link Streams

DOI10.1145/3569168MaRDI QIDQ6127836zbMATH OpenOpenAlexFDO

Authors Pilu Crescenzi, Andrea Marino

Publication date 14 April 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3569168

zbMATH Keywords

diameterlink streamstime-dependent graphs

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

(6)

• On computing the diameter of (weighted) link streams
• On computing optimal temporal branchings
• On computing large temporal (unilateral) connected components
• On computing optimal temporal branchings and spanning subgraphs
• Making the interval membership width of temporal graphs connected and bidirectional
• Making the interval membership width of temporal graphs connected and bidirectional

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 Q6127836)