摘要:
A graph is calledk-connected ork-vertex-connected if its vertex connectivity iskor greater. This means a graph G is said to be k-connected if there does not exist a set of k-1 vertices whose removal disconnects the graph 阅读全文
posted @ 2012-08-22 09:59
york_hust
阅读(193)
评论(0)
推荐(0)
摘要:
What this notation T(n)=Θ(n2) meansFor a given function g(n), we denote by Θ(g(n)) the set of functionsΘ(g(n)) = {f(n): there exist positive constants c1, c2 , and n0 such that0≤c1g(n)≤f(n)≤c2g(n) for all n≥n0}. We could write “f(n)∈Θ(g(n))” to indicate that f(n) is a member of Θ(g(n)). Instead, ... 阅读全文
posted @ 2012-08-22 09:11
york_hust
阅读(375)
评论(0)
推荐(0)