American Psychological Association 6th edition

Subhankar Ghosal, & Sasthi C. Ghosh. (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

ISO-690 (author-date, English)

SUBHANKAR GHOSAL und SASTHI C. GHOSH, 2024. Expected polynomial-time randomized algorithm for graph coloring problem. Discrete Applied Mathematics. 1 September 2024. Vol. 354, , p. 108-121. DOI 10.1016/j.dam.2023.08.001.

Modern Language Association 9th edition

Subhankar Ghosal, und Sasthi C. Ghosh. „Expected Polynomial-Time Randomized Algorithm for Graph Coloring Problem“. Discrete Applied Mathematics, Bd. 354, September 2024, S. 108-21, https://doi.org/10.1016/j.dam.2023.08.001.

Mohr Siebeck - Recht (Deutsch - Österreich)

Subhankar Ghosal/Sasthi C. Ghosh: Expected polynomial-time randomized algorithm for graph coloring problem, Discrete Applied Mathematics 2024, 108-121.

Emerald - Harvard

Subhankar Ghosal und Sasthi C. Ghosh. (2024), „Expected polynomial-time randomized algorithm for graph coloring problem“, Discrete Applied Mathematics, Vol. 354, S. 108-121.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.