Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring

DOI10.1145/3519935.3520005arXiv2203.10984MaRDI QIDQ6083481

Unnamed Author, Sepehr Assadi, Unnamed Author

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.10984

zbMATH Keywords

graph coloringstreaming algorithmsBrooks' theorem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Distributed coloring of hypergraphs

This page was built for publication: Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring