[PDF] Top 20 The symmetry number problem for trees

... Abstract For trees, we define the notion of the so-called symmetry number to measure the size of the maximum subtree that exhibits an axial symmetry in graph ... See full document

... algorithm for fault-tolerant broadcasting in a ...algorithm, the source node sends the message to all its neighbors at ...Then, the neighbors in turn send the message to adjacent nodes ... See full document

... Our new labeling method transforms the complement spanning tree matrix G into matrix whose left-upper submatrix is an identity matrix and whose right-lower submatr[r] ... See full document

... Received by the editors June 30, 1989; accepted for publication (in revised form) March 6, 1990. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojs[r] ... See full document

... allowed. For terms and notations used in this paper we refer to the textbook by West ...graph. For any two vertices u and v, the distance from u to v, denoted by d(u, v), is the least ... See full document

... formula for the number of spanning trees of a multi-complete/star related graph G = K n − K m (a 1 , a 2 , ...that the ith complete graph has a i + 1 nodes; the jth star graph ... See full document

... to the forest to select the piece of ...where the tree has been cut.” Help the poor man to find out the largest piece of ...of the land is measured in units of number of ... See full document

... that the concentration often induces the asymptotic ...symmetry. For example, spherical Harnack inequalities have been proved for blowup solutions to either mean field equations on ... See full document

... Comparisons among the three algorithms in terms of average percentage above the lower bound, average rank, number of problems receiving the best solutions, worst solution i[r] ... See full document

... In this paper, both the 1-MVE problem and k-MVE problem are considered for a special class of graphs called two-terminal series-parallel graphs [5], The formal description of t[r] ... See full document

... any number of times without purchasing an item there; (3) the traveling purchaser may purchase as many items as there are available at each market; and (4) no items are available at the domicile v 1 ... See full document

... In the past few years, many researchers focus on the research in classification and decision-tree learning ...algorithms. For those decision-tree learning algorithms, there are still challenging ... See full document

... 摘要: The determination of the rotational symmetry of a shape is useful for object recognition and shape analysis in computer vision ...analyse the rotational symmetry of a given ... See full document

... and the Group Fourier Transform Observe, how in the proof of the results Theorem ...above, the construction of the “local inverses” ρ 1 and ρ 2 was based on analysis of the ... See full document

... and the relaxation times. The results of the anomalous Hall effect arising from the nonmagnetic impurities are ...effects The pairing symmetry of the order parameter in ... See full document

... Although the proposed algorithms are optimal in terms of time complexity, there may still be room for improvement when the algorithm is used in applications such as message broadcast or media access ... See full document

... on the approximation algorithm for an SROCT. For the PROCT problem, it has been shown that an optimal solution for a graph has the same value as the one for ... See full document

... with the scoring functions mini- mum tree size and L 1 -min increment, respec- ...represents the number of occurrences that the performance of the method is superior to those of ... See full document

... serious problem in concept classi!cation. In particular, the boundaries among classes are not always clearly ...de!ned. For example, there are usually uncertainties in diagnoses based on data from ... See full document

... Key words, sparse matrix, profile, labeling, tree, leaf, centroid, basic path, algorithm AMS subject classifications.. The profile minimization problem was introduced by [5], [6] as a te[r] ... See full document