Lower bounds for the majority communication complexity of various graph accessibility problems

DOI10.1007/3-540-60246-1_136zbMATH Open1193.68137OpenAlexW2565614473MaRDI QIDQ3569020

Stephan Waack, Christoph Meinel

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_136

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Lower bounds for the majority communication complexity of various graph accessibility problems

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