搜索结果: 1-1 共查到“概率论 Rainbow-k-Connectivity”相关记录1条 . 查询时间(0.053 秒)
A path in an edge-colored graph is called a rainbow path if all edges on it have pairwise
distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the
minimum number o...