ARGE, L. und ZEH, N., 2003. I/O-efficient strong connectivity and depth-first search for directed planar graphs. In: . 1 Januar 2003.
Elsevier - Harvard (with titles)Arge, L., Zeh, N., 2003. I/O-efficient strong connectivity and depth-first search for directed planar graphs, in: . https://doi.org/10.1109/SFCS.2003.1238200
American Psychological Association 7th editionArge, L., & Zeh, N. (2003, Januar 1). I/O-efficient strong connectivity and depth-first search for directed planar graphs. https://doi.org/10.1109/SFCS.2003.1238200
Springer - Basic (author-date)Arge L, Zeh N (2003) I/O-efficient strong connectivity and depth-first search for directed planar graphs
Juristische Zitierweise (Stüber) (Deutsch)Arge, L./ Zeh, N., I/O-efficient strong connectivity and depth-first search for directed planar graphs, 2003, .
Bitte prüfen Sie die Zitate auf Korrektheit, bevor Sie diese in Ihre Arbeit einfügen.