Towards the locality of Vizing’s theorem-Reference-Cited by-同舟云学术

Towards the locality of Vizing’s theorem

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Su Hsin-Hao¹,Vu Hoa T.¹

Affiliation:

1. Boston College, USA

Publisher

ACM

Link

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

Reference49 articles.

1. Noga Alon László Babai and Alon Itai. 1986. Noga Alon László Babai and Alon Itai. 1986.

2. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of algorithms 7 4 (1986) 567–583. 10.1016/0196-6774(86)90019-2 A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of algorithms 7 4 (1986) 567–583. 10.1016/0196-6774(86)90019-2

3. Eshrat Arjomandi. 1982. Eshrat Arjomandi. 1982.

4. An Efficient Algorithm for Colouring the Edges of a Graph With ( ∆ + 1) Colours. INFOR: Information Systems and Operational Research 20 2 (1982) 82–101. An Efficient Algorithm for Colouring the Edges of a Graph With ( ∆ + 1) Colours. INFOR: Information Systems and Operational Research 20 2 (1982) 82–101.

5. Leonid Barenboim. 2015. Leonid Barenboim. 2015.

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

1. Distributed Graph Coloring Made Easy;ACM Transactions on Parallel Computing;2023-12-14

2. On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition;SIAM Journal on Discrete Mathematics;2023-06-07

3. The Power of Multi-step Vizing Chains;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Distributed Edge Coloring in Time Polylogarithmic in Δ;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

5. Linial for lists;Distributed Computing;2022-05-17