Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage
American Psychological Association 6th edition

Lulli, A., Carlini, E., Dazzi, P., Lucchese, C., & Ricci, L. (2017). Fast Connected Components Computation in Large Graphs by Vertex Pruning. IEEE Transactions on Parallel & Distributed Systems, 28(3), 760-773. https://doi.org/10.1109/TPDS.2016.2591038

ISO-690 (author-date, English)

LULLI, Alessandro, CARLINI, Emanuele, DAZZI, Patrizio, LUCCHESE, Claudio und RICCI, Laura, 2017. Fast Connected Components Computation in Large Graphs by Vertex Pruning. IEEE Transactions on Parallel & Distributed Systems. 1 März 2017. Vol. 28, no. 3, p. 760-773. DOI 10.1109/TPDS.2016.2591038.

Modern Language Association 9th edition

Lulli, A., E. Carlini, P. Dazzi, C. Lucchese, und L. Ricci. „Fast Connected Components Computation in Large Graphs by Vertex Pruning.“. IEEE Transactions on Parallel & Distributed Systems, Bd. 28, Nr. 3, März 2017, S. 760-73, https://doi.org/10.1109/TPDS.2016.2591038.

Mohr Siebeck - Recht (Deutsch - Österreich)

Lulli, Alessandro/Carlini, Emanuele/Dazzi, Patrizio/Lucchese, Claudio/Ricci, Laura: Fast Connected Components Computation in Large Graphs by Vertex Pruning., IEEE Transactions on Parallel & Distributed Systems 2017, 760-773.

Emerald - Harvard

Lulli, A., Carlini, E., Dazzi, P., Lucchese, C. und Ricci, L. (2017), „Fast Connected Components Computation in Large Graphs by Vertex Pruning.“, IEEE Transactions on Parallel & Distributed Systems, Vol. 28 No. 3, S. 760-773.

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