排序方式： 共有4条查询结果，搜索用时 15 毫秒
1
1.
提出一种将信任度与参数化身份约束相结合的凭证链发现算法.模拟实验表明,该算法可以有效地对不良实体的请求进行屏蔽,实现了较灵活的细粒度授权;同时该算法提高了计算效率,减少了建立凭证链所耗费的空间. 相似文献
2.
A graph is called claw-free if it does not contain a claw as its induced subgraph. In this paper, we prove the following results : 1 ) If G is a 2-connected claw-free graph on n vertices, then for any vertex υ and any two distinct vertices x and y in V(G) - |υ| , G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G - C,and if H is connected but not 2-connected, then there exist nonadjacent vertices u and v in H such that |V(C)| ≥3(d(u) d(u)) -2. 相似文献
3.
李明楚 《天津大学学报(英文版)》2003,9(4):273-278
A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper, it is proved that every 2-connected k-regular claw-free graph on at most 5k( k ≥ 10) vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k 1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamihonian. 相似文献
4.
提出一种将信任度与参数化身份约束相结合的凭证链发现算法.模拟实验表明,该算法可以有效地对不良实体的请求进行屏蔽,实现了较灵活的细粒度授权;同时该算法提高了计算效率,减少了建立凭证链所耗费的空间. 相似文献
1