Randomized communication and implicit graph representations

DOI10.46298/THEORETICS.25.20MaRDI QIDQ6912581zbMATH OpenFDO

Authors Nathaniel Harms, Sebastian Wild, Victor Zamaraev

Publication date 22 October 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

implicit graph representationshereditary graph classesrandomized communication complexityadjacency labeling schemesadjacency sketchesconstant-cost protocolsprobabilistic universal graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication theory (94A05) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

This page was built for publication: Randomized communication and implicit graph representations

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