'Clique cover' presentation slideshows

?????? ?????????? ???????????-??????????-?????????

522 views • 39 slides

NP-Completeness

NP-Completeness. More Reductions. Definitions. P: is the class of all decision problems which can be solved in polynomial time, O(n ^ k) for some constant k. For example MST ? P but HC is not known (and suspected not) to be in P.

585 views • 37 slides

???????????

???????????. ?? ???????. The vertex arboricity va(G) of a graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces a forest of G.

392 views • 20 slides