Local update algorithms for random graphs

DOI10.1007/978-3-642-54423-1_32MaRDI QIDQ5405055zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Local algorithms for graphs
• scientific article; zbMATH DE number 1263228
• Publication:4886061
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Average-case analysis of dynamic graph algorithms

Cited in

(5)

• Efficient local updates for undirected graphical models
• Random Node-Asynchronous Updates on Graphs
• Expansion and flooding in dynamic random networks with node churn
• Preserving the number of cycles of length k in a growing uniform permutation
• On verifying and maintaining connectivity of interval temporal networks

This page was built for publication: Local update algorithms for random graphs

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