Pairing computation on Edwards curves with high-degree twists
2021-02-22 14:06:40
236KB
1
Let G be a planar graph with maximum degree Δ ≥ 8 and without chordal.5-cycles. Then χ l (G) = Δ and χ l (G) = Δ + 1.
2021-02-07 12:05:49
344KB
1
利用python绘制热图、计算网络节点degree、kshell、介数中心性、接近中心性、特征向量中心性、PageRank，计算相关性含环境、代码、数据源
2019-12-21 21:11:14
56.89MB
1