A study of connectivity on dynamic graphs: computing persistent connected components

DOI10.1007/s10288-022-00507-3zbMath1515.05101MaRDI QIDQ6097848

Yoann Pigné, Eric Sanlaville, Mathilde Vernet

Publication date: 7 June 2023

Published in: 4OR (Search for Journal in Brave)

zbMATH Keywords

connectivityonline algorithmdynamic graphspersistent connected component

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks
• A connectivity model for agreement in dynamic systems
• Components in time-varying graphs
• Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• On Verifying and Maintaining Connectivity of Interval Temporal Networks
• Collective dynamics of ‘small-world’ networks
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks

This page was built for publication: A study of connectivity on dynamic graphs: computing persistent connected components