Derakhshan, M., Ghasemi, A., & Rajaraman, R. (2025). One-way Communication Complexity of Minimum Vertex Cover in General Graphs.
Style de citation Chicago (17e éd.)Derakhshan, Mahsa, Andisheh Ghasemi, et Rajmohan Rajaraman. One-way Communication Complexity of Minimum Vertex Cover in General Graphs. 2025.
Style de citation MLA (9e éd.)Derakhshan, Mahsa, et al. One-way Communication Complexity of Minimum Vertex Cover in General Graphs. 2025.
Attention : ces citations peuvent ne pas être correctes à 100%.