On the choice number of complete multipartite graphs with part size four.

Hal A. Kierstead Andrew Salmon Ran Wang

Published in: Eur. J. Comb. (2016)

Keyphrases

maximum number
databases
small number
data streams
grow exponentially
learning algorithm
image segmentation
fixed number
space complexity
np hard
random sample
network size
random graphs
graph theoretic
directed graph
database
computational complexity
pattern recognition
decision trees
information retrieval
data sets