We first present polynomial algorithms to compute maximum independent sets in the categorical products of two cographs or two splitgraphs, respectively. Then we prove that computing the independent set of the categorical product of a planar graph of maximal degree three and K 4 is NP-complete. The ultimate categorical independence ratio of a graph G is defined as lim k → ∞ α(G k )/n k . The ultimate categorical independence ratio can be computed in polynomial time for cographs, permutation graphs, interval graphs, graphs of bounded treewidth and splitgraphs. Also, we present an O â̂- (3 n/3) exact, exponential algorithm for the ultimate categorical independence ratio of general graphs. We further present a PTAS for the ultimate categorical independence ratio of planar graphs. Lastly, we show that the ultimate categorical independent domination ratio for complete multipartite graphs is zero, except when the graph is complete bipartite with color classes of equal size (in which case it is 1/2).