DAM
2008
13 years 11 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
DAM
2008
13 years 11 months ago
2008
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
DAM
2008
13 years 11 months ago
2008
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
DAM
2008
13 years 11 months ago
2008
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimi...
DAM
2008
13 years 11 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
Recently, Stanley [13] studied the length of the longest alternating subsequence of a permutation in the symmetric group, where a sequence a, b, c, d, . . . is alternating if a &g...
DAM
2008
13 years 11 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...