KAMMER, Frank, KRATSCH, Dieter und LAUDAHN, Moritz, 2019. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica. 1 März 2019. Vol. 81, no. 3, p. 1180-1204. DOI 10.1007/s00453-018-0464-z.
Elsevier - Harvard (with titles)Kammer, F., Kratsch, D., Laudahn, M., 2019. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica 81, 1180-1204. https://doi.org/10.1007/s00453-018-0464-z
American Psychological Association 7th editionKammer, F., Kratsch, D., & Laudahn, M. (2019). Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica, 81(3), 1180-1204. https://doi.org/10.1007/s00453-018-0464-z
Springer - Basic (author-date)Kammer F, Kratsch D, Laudahn M (2019) Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs.. Algorithmica 81:1180-1204. https://doi.org/10.1007/s00453-018-0464-z
Juristische Zitierweise (Stüber) (Deutsch)Kammer, Frank/ Kratsch, Dieter/ Laudahn, Moritz, Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs., Algorithmica 2019, 1180-1204.