𝔖 Bobbio Scriptorium
✦   LIBER   ✦

*w > y in Chontal (Mayan) of Tabasco and Generalizations concerning the Palatalization of w

✍ Scribed by John S. Justeson


Book ID
111866836
Publisher
University of Chicago Press
Year
1985
Tongue
English
Weight
244 KB
Volume
51
Category
Article
ISSN
0020-7071

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Some generalizations of the steiner prob
✍ C. W. Duin; A. Volgenant πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning