Chapter 8. Generalized Shortest Path Trees: A Novel Graph Class by Example of Semiotic Networks
- PD Dr. habil. Matthias Dehmer2,3,
- Prof. Dr. Frank Emmert-Streib4
Published Online: 21 AUG 2009
DOI: 10.1002/9783527627981.ch8
Copyright © 2009 Wiley-VCH Verlag GmbH & Co. KGaA
Book Title
Analysis of Complex Networks: From Biology to Linguistics
Additional Information
How to Cite
Mehler, A. (2009) Generalized Shortest Path Trees: A Novel Graph Class by Example of Semiotic Networks, in Analysis of Complex Networks: From Biology to Linguistics (eds M. Dehmer and F. Emmert-Streib), Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, Germany. doi: 10.1002/9783527627981.ch8
Editor Information
- 2
Vienna University of Technology, Discrete Mathematics and Geometry, Wiedner Hauptstraße 8–10, 1040 Vienna, Austria
- 3
University of Coimbra, Center for Mathematics, Apartado 3008, 3001-454 Coimbra, Portugal
- 4
Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen's University Belfast, 97 Lisburn Road, Belfast, BT9 7BL, UK
Publication History
- Published Online: 21 AUG 2009
- Published Print: 22 APR 2009
ISBN Information
Print ISBN: 9783527323456
Online ISBN: 9783527627981
- Summary
- Chapter
- References
Keywords:
- shortest path trees;
- novel graph class;
- semiotic networks
Summary
This chapter contains sections titled:
Introduction
A Class of Tree-Like Graphs and Some of Its Derivatives
Semiotic Systems as Conceptual Graphs
References