656 search results - page 17 / 132 » Marrying Words and Trees |
ALGORITHMICA
2008
14 years 9 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
EJC
2010
14 years 9 months ago
2010
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
ORL
2010
14 years 8 months ago
2010
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
DIAGRAMS
2008
Springer
2008
Springer
Visualizing Non-subordination and Multidominance in Tree Diagrams: Testing Five Syntax Tree Variants
14 years 11 months ago
In linguistics, it is quite common to use tree diagrams for immediate constituent analysis of sentences. Traditionally, these trees are binary and twodimensional. However, phenomen...
EOR
2006
14 years 9 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...