Gebremedhin, A. H., & Manne, F. (2000). Scalable parallel graph coloring algorithms. Concurrency (Chichester, England.), 12(12), 1131-1146. https://doi.org/10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2
Chicago Style (17th ed.) CitationGebremedhin, Assefaw Hadish, and Fredrik Manne. "Scalable Parallel Graph Coloring Algorithms." Concurrency (Chichester, England.) 12, no. 12 (2000): 1131-1146. https://doi.org/10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2.
MLA (9th ed.) CitationGebremedhin, Assefaw Hadish, and Fredrik Manne. "Scalable Parallel Graph Coloring Algorithms." Concurrency (Chichester, England.), vol. 12, no. 12, 2000, pp. 1131-1146, https://doi.org/10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2.
Warning: These citations may not always be 100% accurate.