摘要： thegraph partitionproblem is defined on data represented in the form of a graphG= (V,E), withVvertices andEedges, such that it is possible to partitionGinto smaller components with specific properties. For instance, ak-way partition divides the vertex set intoksmaller components. A good partition .. 阅读全文

摘要： Hypergraph colouring is defined as follows. Letbe a hypergraph such that. Then(??)is a proper colouring ofif and only if, for allthere existssuch that.In other words: For every edge in the graph having at least two nodes as endpoints, the nodes this edge connects are not all of the same color.A colo 阅读全文

摘要： Equivocation: a faulty processor that lies (inconsistently) to two correct processors.指一个错误节点对两个正确节点发出不一致的信息,而这两个正确节点分别认为所有的正确节点都收到了一致的信息比如有n=3f个节点,其中有f个错误节点,当这f个错误节点中有一个节点发出信息a给f个正确节点(集A),发出信息b给另外f个正确节点(集B),当所有2f个正确节点都认为所有正确节点都收到了相同的信息,这个错误节点equivocation成功.那么正确节点如何判断所有正确节点都收到了相同的信息呢?通过广播,每个节点把自己收到的 阅读全文

摘要： 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 阅读全文

摘要： 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, ... 阅读全文