Randomized communication and implicit graph representations-Reference-Cited by-同舟云学术

Randomized communication and implicit graph representations

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Harms Nathaniel¹,Wild Sebastian²,Zamaraev Viktor²

Affiliation:

1. University of Waterloo, Canada

2. University of Liverpool, UK

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519978

Reference59 articles.

1. Jungho Ahn Kevin Hendrey Donggyu Kim and Sang-il Oum. 2021. Bounds for the Twin-width of Graphs. arXiv preprint arXiv:2110.03957 https://doi.org/10.48550/arXiv.2110.03957 10.48550/arXiv.2110.03957

2. Jungho Ahn Kevin Hendrey Donggyu Kim and Sang-il Oum. 2021. Bounds for the Twin-width of Graphs. arXiv preprint arXiv:2110.03957 https://doi.org/10.48550/arXiv.2110.03957

3. Range of values of entropy of hereditary classes of graphs;Alekseev Vladimir Evgen’evich;Diskretnaya Matematika,1992

4. Vladimir Evgen’evich Alekseev . 1997. On lower layers of a lattice of hereditary classes of graphs. Diskretnyi Analiz i Issledovanie Operatsii, 4, 1 ( 1997 ), 3–12. Vladimir Evgen’evich Alekseev. 1997. On lower layers of a lattice of hereditary classes of graphs. Diskretnyi Analiz i Issledovanie Operatsii, 4, 1 (1997), 3–12.

5. Forbidden induced bipartite graphs

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph parameters, implicit representations and factorial properties;Discrete Mathematics;2023-10

2. Logical labeling schemes;Discrete Mathematics;2023-10

3. The Implicit Graph Conjecture is False;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Randomized communication and implicit graph representations;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Graph Parameters, Implicit Representations and Factorial Properties;Lecture Notes in Computer Science;2022