Local Update Algorithms for Random Graphs

DOI10.1007/978-3-642-54423-1_32zbMath1405.68243OpenAlexW345230712MaRDI QIDQ5405055

Philippe Duchon, Romaric Duvignau

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_32

zbMATH Keywords

random graphsrandomness preservationdynamic graphslogical network maintenance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ Expansion and flooding in dynamic random networks with node churn ⋮ Preserving the number of cycles of length \(k\) in a growing uniform permutation

This page was built for publication: Local Update Algorithms for Random Graphs