1.

The upper bound of computing time of m coloring decision problem is

A. O(nm)
B. O(nm)
C. O(nmn)
D. O(nmmn)
Answer» D. O(nmmn)


Discussion

No Comment Found