TITLE

# Index

PUB. DATE
June 2004
SOURCE
Trees (9780751338720);2004, p218
SOURCE TYPE
Book
DOC. TYPE
Article
ABSTRACT
An index for the book "Trees," by Allen Coombes is presented.
ACCESSION #
43678670

## Related Articles

• INDEX.  // Peterson Field Guide to Western Trees: Western United States & C;1998, p414

A subject index for the book "A Field Guide to Western Trees" is presented.

• Appendix A: TREE FAMILIES.  // Trees of Texas;2003, p243

The article lists the tree families of the trees profiles in the book "Trees of Texas: An Easy Guide to Leaf Identification," by Carmine Stahjl and Ria McElvaney.

• INDEX.  // Trees of Texas;2003, p274

A subject index for the book "Trees of Texas: An Easy Guide to Leaf Identification," by Carmine A. Stahl and Ria McElvaney is presented.

• INDEX.  // Reunion of Trees: The Discovery of Exotic Plants & Their Introdu;1990, p261

A subject index for the book "Reunion of Trees: The Discovery of Exotic Plants & Their Introduction Into North American & European Landscapes, 1990" is presented.

• Author index.  // Tree Physiology;Dec2002, Vol. 22 Issue 18, p1317

An author index for the Volume 22, 2002 issue of "Tree Physiology" is presented.

• Keyword index.  // Tree Physiology;Dec2002, Vol. 22 Issue 18, p1319

A subject index for the Volume 22, 2002 issue of "Tree Physiology" is presented.

• The Merrifield—Simmons Indices and Hosoya Indices of Trees with k Pendant Vertices. Aimei Yu; Xuezheng Lv // Journal of Mathematical Chemistry;Jan2007, Vol. 41 Issue 1, p33

The Merrifield?Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we characterize the trees with maximal Merrifield?Simmons indices and minimal...

• The first and second largest Merrifield—Simmons indices of trees with prescribed pendent vertices. Maolin Wang; Hongbo Hua; Dongdong Wang // Journal of Mathematical Chemistry;Feb2008, Vol. 43 Issue 2, p727

The Merrifieldâ€“Simmons index $${\sigma(G)}$$ of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are non-adjacent, i.e., the number of independent-vertex sets of G. By T(n,k) we denote the set of trees with n vertices and with k pendent vertices....

• Ranking Categorical Features Using Generalization Properties. Sabato, Sivan; Shalev-Shwartz, Shai // Journal of Machine Learning Research;6/1/2008, Vol. 9 Issue 6, p1083

Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ranking method that supports categorical features with a large number of possible values. We show that existing ranking...

Share