Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks
Mehler A (2009)
In: Analysis of Complex Networks: From Biology to Linguistics. Dehmer M, Emmert-Streib F (Eds); Weinheim: Wiley-VCH: 175-220.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
mehler_2009_b.pdf
Autor*in
Herausgeber*in
Dehmer, Matthias;
Emmert-Streib, Frank
Einrichtung
Erscheinungsjahr
2009
Buchtitel
Analysis of Complex Networks: From Biology to Linguistics
Seite(n)
175-220
Page URI
https://pub.uni-bielefeld.de/record/1996499
Zitieren
Mehler A. Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks. In: Dehmer M, Emmert-Streib F, eds. Analysis of Complex Networks: From Biology to Linguistics. Weinheim: Wiley-VCH; 2009: 175-220.
Mehler, A. (2009). Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks. In M. Dehmer & F. Emmert-Streib (Eds.), Analysis of Complex Networks: From Biology to Linguistics (pp. 175-220). Weinheim: Wiley-VCH.
Mehler, Alexander. 2009. “Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks”. In Analysis of Complex Networks: From Biology to Linguistics, ed. Matthias Dehmer and Frank Emmert-Streib, 175-220. Weinheim: Wiley-VCH.
Mehler, A. (2009). “Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks” in Analysis of Complex Networks: From Biology to Linguistics, Dehmer, M., and Emmert-Streib, F. eds. (Weinheim: Wiley-VCH), 175-220.
Mehler, A., 2009. Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks. In M. Dehmer & F. Emmert-Streib, eds. Analysis of Complex Networks: From Biology to Linguistics. Weinheim: Wiley-VCH, pp. 175-220.
A. Mehler, “Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks”, Analysis of Complex Networks: From Biology to Linguistics, M. Dehmer and F. Emmert-Streib, eds., Weinheim: Wiley-VCH, 2009, pp.175-220.
Mehler, A.: Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks. In: Dehmer, M. and Emmert-Streib, F. (eds.) Analysis of Complex Networks: From Biology to Linguistics. p. 175-220. Wiley-VCH, Weinheim (2009).
Mehler, Alexander. “Generalized Shortest Paths Trees: A Novel Graph Class Applied to Semiotic Networks”. Analysis of Complex Networks: From Biology to Linguistics. Ed. Matthias Dehmer and Frank Emmert-Streib. Weinheim: Wiley-VCH, 2009. 175-220.
Volltext(e)
Name
mehler_2009_b.pdf
Access Level
Closed Access
Zuletzt Hochgeladen
2019-09-06T08:57:17Z
MD5 Prüfsumme
3757f54e6a83d19c1d3b09b59c5421d0
Google Scholar