Generalized shortest path trees: a novel graph class by example of semiotic networks

MaRDI QIDQ2906541zbMATH OpenFDO

Authors Alexander Mehler

Publication date 5 September 2012

zbMATH Keywords

semiotic systemssocial taggingdiscourse structurestext networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (05C99)

Recommendations

• Special graph representation and visualization of semantic networks
• An extension of labeling techniques for finding shortest path trees
• An empirical study of the structure of the shortest path tree
• scientific article; zbMATH DE number 1528594
• Shortest shortest path trees of a network
• Network-Tree Model and Shortest Path Algorithm
• On pathos lict edge semientire graph of a tree
• On pathos semitotal point graph of a tree
• Introduction to graph grammars with applications to semantic networks
• Effectiveness of representation and length variation of shortest paths in graph classification

Cited in

(1)

• Minimum spanning Markovian trees: Introducing context-sensitivity into the generation of spanning trees

This page was built for publication: Generalized shortest path trees: a novel graph class by example of semiotic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906541)