American Psychological Association 6th edition

COULLARD, C. R., RAIS, A., RARDIN, R. L., & WAGNER, D. K. (1993). Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs. Networks (New York, NY), 23(3), 195-206.

ISO-690 (author-date, English)

COULLARD, C. R, RAIS, A, RARDIN, R. L und WAGNER, D. K, 1993. Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs. Networks (New York, NY). 1 Januar 1993. Vol. 23, no. 3, p. 195-206.

Modern Language Association 9th edition

COULLARD, C. R., A. RAIS, R. L. RARDIN, und D. K. WAGNER. „Linear-Time Algorithms for the 2-Connected Steiner Subgraph Problem on Special Classes of Graphs“. Networks (New York, NY), Bd. 23, Nr. 3, Januar 1993, S. 195-06.

Mohr Siebeck - Recht (Deutsch - Österreich)

COULLARD, C. R/RAIS, A/RARDIN, R. L/WAGNER, D. K: Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs, Networks (New York, NY) 1993, 195-206.

Emerald - Harvard

COULLARD, C.R., RAIS, A., RARDIN, R.L. und WAGNER, D.K. (1993), „Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs“, Networks (New York, NY), Vol. 23 No. 3, S. 195-206.

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