Sciweavers

3 search results - page 1 / 1
» Unordered Canonical Ramsey Numbers
Sort
View
JCT
2000
110views more  JCT 2000»
13 years 10 months ago
Unordered Canonical Ramsey Numbers
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growt...
Duncan C. Richer
GC
2011
Springer
13 years 5 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 4 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz