On-line Ranking Algorithms for Trees
نویسندگان
چکیده
A node k-ranking of a graph G = (V, E) is a proper node coloring C: V {1, 2, ..., k} such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) C(x). In the on-line version of this problem, the nodes v1, v2,..., vn are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v1, v2, ..., vi}] are known when the color of vi has to be chosen. This paper gives an on-line ranking algorithm for general trees and an optimal on-line ranking algorithm for the special trees, K1,n, also called stars.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملNonparametric scoring methods as a support decision tool for medical diagnosis – The TreeRank algorithm and its variants
In this paper we propose to use nonparametric scoring methods based on ranking trees as a support decision tool for medical diagnosis. The proposed algorithms enable to order cohorts of patients according to the risk level of developing a particular disease. The aim of this paper is to illustrate the potential of various algorithms using ranking trees, particularly the variants with bagging-typ...
متن کاملA New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملRelational Ranking with Predictive Clustering Trees
A novel class of applications of predictive clustering trees is addressed, namely relational ranking. Predictive clustering trees, as implemented in TILDE, allow for predicting multiple target variables from relational data. This approach makes sense especially if the target variables are not independent of each other. This is typically the case in ranking, where the (relative) performance of s...
متن کاملLexicographic Listing and Ranking of r-ary Trees
This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...
متن کامل