Data mining (DM) research has successfully developed advanced DM techniques and algorithms over the last few decades, and many organisations have great expectations to take more be...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
A matroid-like structure defined on a convex geometry, called a cg-matroid, is defined by S. Fujishige, G. A. Koshevoy, and Y. Sano in [9]. A cg-matroid whose rank function is nat...
A path bundle is a set of 2a paths in an n-cube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths form two s...
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...