搜索结果: 1-2 共查到“数学 Rainbow-k-Connectivity”相关记录2条 . 查询时间(0.062 秒)
On rainbow-k-connectivity of random graphs
Rainbow connectivity Random graph Graph algorithms Sharp threshold function Probabilistic method
2012/12/4
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k 1, the rainbow-k-connectivity of a graph G, denoted by rck(G), is the minimum number of colors...
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...