American Psychological Association 6th edition

HSU, F. R., SHAN, M. K., CHAO, H. S., & LEE, R. C. T. (2005). Some optimal parallel algorithms on interval and circular-arc graphs. Journal of Information Science and Engineering, 21(3), 627-642.

ISO-690 (author-date, English)

HSU, F. R, SHAN, M. K, CHAO, H. S und LEE, R. C. T, 2005. Some optimal parallel algorithms on interval and circular-arc graphs. Journal of information science and engineering. 1 Januar 2005. Vol. 21, no. 3, p. 627-642.

Modern Language Association 9th edition

HSU, F. R., M. K. SHAN, H. S. CHAO, und R. C. T. LEE. „Some Optimal Parallel Algorithms on Interval and Circular-Arc Graphs“. Journal of Information Science and Engineering, Bd. 21, Nr. 3, Januar 2005, S. 627-42.

Mohr Siebeck - Recht (Deutsch - Österreich)

HSU, F. R/SHAN, M. K/CHAO, H. S/LEE, R. C. T: Some optimal parallel algorithms on interval and circular-arc graphs, Journal of information science and engineering 2005, 627-642.

Emerald - Harvard

HSU, F.R., SHAN, M.K., CHAO, H.S. und LEE, R.C.T. (2005), „Some optimal parallel algorithms on interval and circular-arc graphs“, Journal of Information Science and Engineering, Vol. 21 No. 3, S. 627-642.

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