34 search results - page 2 / 7 » On the Finiteness of the Recursive Chromatic Number |
COMBINATORICS
2007
13 years 5 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
ENTCS
2008
13 years 4 months ago
2008
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
ICW
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— In this paper, we present an analytical study targeted at statistically capturing the loss behavior of a RED queue. We utilize a finite-state Markov chain model. Start...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
SIAMDM
2008
13 years 5 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...