Affiliation:
1. Univ. of California, Berkeley
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference13 articles.
1. The Complexity of Near-Optimal Graph Coloring
2. HA~tt'f F. Graph Theory. Reading Mass. 1971. HA~tt'f F. Graph Theory. Reading Mass. 1971.
3. Reducibility among Combinatorial Problems
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Better Coloring of 3-Colorable Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Robust Factorizations and Colorings of Tensor Graphs;SIAM Journal on Discrete Mathematics;2024-02-28
3. Towards the Formal Verification of Wigderson’s Algorithm;Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2023-10-22
4. Approximate Graph Colouring and the Hollow Shadow;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. CLAP: A New Algorithm for Promise CSPs;SIAM Journal on Computing;2023-01-25