Ghosal, S., & Ghosh, S. C. (2024). Expected polynomial-time randomized algorithm for graph coloring problem. Discrete Applied Mathematics, 354, 108-121. https://doi.org/10.1016/j.dam.2023.08.001
Citace podle Chicago (17th ed.)Ghosal, Subhankar, a Sasthi C. Ghosh. "Expected Polynomial-time Randomized Algorithm for Graph Coloring Problem." Discrete Applied Mathematics 354 (2024): 108-121. https://doi.org/10.1016/j.dam.2023.08.001.
Citace podle MLA (9th ed.)Ghosal, Subhankar, a Sasthi C. Ghosh. "Expected Polynomial-time Randomized Algorithm for Graph Coloring Problem." Discrete Applied Mathematics, vol. 354, 2024, pp. 108-121, https://doi.org/10.1016/j.dam.2023.08.001.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..