英语翻译,英译汉,谢谢了大神们~
Similarly,thegraph-theoreticconceptofavertexcut-setgeneralizesthecutpointtoaddressthe...
Similarly, the graph-theoretic concept of a vertex cut-set generalizes the cutpoint to address
the ensemble issue directly. A vertex cutset is a set of nodes whose removal would increase
the number of components in the graph. Most graph-theoretic work has focused on minimum
weight cutsets, which are smallest sets that have the cutset property. However, cutsets retain
many of the same difficulties as cutpoints when applied to the KPP-Neg problem. First, we
cannot specify the number of nodes in the set and then seek the set of that size that does
the best job (rather, the measure of success is fixed and cutset methods are able to find a
smallest set that achieves that level of success). In this sense, the graph-theoretic approach
solves the inverse of the problem we seek to solve. Second, no account is taken of the size
of components created by the cut. A cut that isolates a single node is no better than one
that divides the graph into equal size components. Third, no account is taken of distances
among nodes. Hence a set whose removal would not only cut the network in half but also
lengthen distances within each half would not be considered better than one that merely cut
the network in half. 展开
the ensemble issue directly. A vertex cutset is a set of nodes whose removal would increase
the number of components in the graph. Most graph-theoretic work has focused on minimum
weight cutsets, which are smallest sets that have the cutset property. However, cutsets retain
many of the same difficulties as cutpoints when applied to the KPP-Neg problem. First, we
cannot specify the number of nodes in the set and then seek the set of that size that does
the best job (rather, the measure of success is fixed and cutset methods are able to find a
smallest set that achieves that level of success). In this sense, the graph-theoretic approach
solves the inverse of the problem we seek to solve. Second, no account is taken of the size
of components created by the cut. A cut that isolates a single node is no better than one
that divides the graph into equal size components. Third, no account is taken of distances
among nodes. Hence a set whose removal would not only cut the network in half but also
lengthen distances within each half would not be considered better than one that merely cut
the network in half. 展开
展开全部
同样,用一个顶点割集的概念,概括了割点,直接处理两方面的总体问题。一个顶点割集是一组节点的删除将脂肪酸食物会增加数量的组件图。最有用的工作都集中在minimumweight cutsets,最小割集的属性集。然而,cutsets retainmany相同的困难cutpoints当应用到KPP-Neg问题。 首先,不到指定数量的节点集,然后寻求组,尺寸,doesthe最好工作(相反,成功与否的标准是固定的和割集方法能够找到asmallest集,达到这个水平的成功)。从这个意义上说,用approachsolves的逆问题我们寻求解决。第二,没有帐户被创建的组件的大小减少。一个切隔离一个节点没有多媒体教育
有道上的
有道上的
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
同样,一个顶点集的概念图的理论部分,直接集成问题分析。一个顶点割集是图中的移动节点集将增加组件的数量。大多数图形理论工作都集中在割集的设计,这是最小割集属性集。然而,割集保留了许多相同的困难负临界值。首先,节点的数量,我们在收集并寻求,大小设置指定,在最好的工作(和,衡量成功的标准是固定的,找到一个最小割集的方法,以达到成功的水平)。在这个意义上,该图的方法解决了我们寻求解决的逆问题。第二,不要通过零件的大小考虑削减。一个切口,单个节点的分离是不超过一成大小相等的组件图。第三,不考虑节点间的距离。因此,一套去除不仅会降低网络的一半,也延长了每六个月将不被视为半切到网络。
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
这部新手机采用钱夹的外型和款式。你无须翻盖便可使用它。它的长度完美贴合你的耳朵和嘴。它拥有一个小型触摸屏,你可以通过这来拨你要打的电话号码。并且它还有一个小型液晶显示屏。你可以看气象报道,新闻,还可以看财经报道。这些新功能会不断更新,这项服务由本公司提供。触摸屏上的Letter键也可以让你把这个电子行业的奇迹作为计算机或者文字处理器来使用。
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询