Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
The primary objective of disparities research is to model the differences across multiple groups and identify the groups that behave significantly different from each other. Indep...
Indranil Palit, Chandan K. Reddy, Kendra L. Schwar...
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...