335 search results - page 9 / 67 » How to Use Spanning Trees to Navigate in Graphs |
100
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
EMNLP
2007
15 years 1 months ago
2007
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
JPDC
2006
14 years 11 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
109
click to vote
ICANN
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
FUIN
2007
14 years 11 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...