Exploration of Time-Varying Connected Graphs with Silent Agents

DOI10.1007/978-3-030-54921-3_9MaRDI QIDQ5100956

Stefan Dobrev, Rastislav Královič, Dana Pardubská

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_9

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Mxx: Computer system organization

68Q11: Communication complexity, information complexity