The Cost of Unknown Diameter in Dynamic Networks
From MaRDI portal
Publication:4625652
DOI10.1145/3209665zbMath1426.68228OpenAlexW2893438813WikidataQ129321778 ScholiaQ129321778MaRDI QIDQ4625652
Yuda Zhao, Irvan Jahja, Haifeng Yu
Publication date: 25 February 2019
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209665
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Some lower bounds in dynamic networks with oblivious adversaries ⋮ Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
This page was built for publication: The Cost of Unknown Diameter in Dynamic Networks