Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs

DOI10.1007/978-3-319-18173-8_6zbMath1459.68153arXiv1502.00089OpenAlexW1861651162MaRDI QIDQ2947012

Joseph G. Peters, Ralf Klasing, Yessin M. Neggaz, Arnaud Casteigts

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.00089

zbMATH Keywords

dynamic graphstime-varying graphs\(T\)-interval connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Online algorithms; streaming algorithms (68W27)

Related Items (2)

A study of connectivity on dynamic graphs: computing persistent connected components ⋮ Computing parameters of sequence-based dynamic graphs

Cites Work

• Distributed computation in dynamic networks
• Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs