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

HOCHBAUM, D. S. (1992). An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs. Operations Research, 40(5), 923-935.

ISO-690 (author-date, English)

HOCHBAUM, D. S, 1992. An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs. Operations research. 1 Januar 1992. Vol. 40, no. 5, p. 923-935.

Modern Language Association 9th edition

HOCHBAUM, D. S. „An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs“. Operations Research, Bd. 40, Nr. 5, Januar 1992, S. 923-35.

Mohr Siebeck - Recht (Deutsch - Österreich)

HOCHBAUM, D. S: An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs, Operations research 1992, 923-935.

Emerald - Harvard

HOCHBAUM, D.S. (1992), „An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs“, Operations Research, Vol. 40 No. 5, S. 923-935.

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