Algorithms on evolving graphs

DOI10.1145/2090236.2090249zbMath1347.68277OpenAlexW2153245628WikidataQ116754400 ScholiaQ116754400MaRDI QIDQ2826051

Mohammad Mahdian, Aris Anagnostopoulos, Ravi Kumar, Fabio Vandin, Eli Upfal

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsminimum spanning treepath connectivityevolving graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Partial sorting problem on evolving data, Unnamed Item, Sorting and selection on dynamic data, Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES