搜索筛选:
搜索耗时3.6369秒,为你在为你在102,285,761篇论文里面共找到 3 篇相符的论文内容
发布年度:
[期刊论文] 作者：Hirotoshi Honma,Kento Nishimur,
来源：应用数学与应用物理(英文) 年份：2019
The vertex connectivity k(G) of a graph G is the minimum number of nodes whose deletion disconnects it. Graph connectivity is one of the most fundamental proble...
[期刊论文] 作者：Hirotoshi Honma,Yoko Nakajima,,
来源：电脑和通信(英文) 年份：2017
Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component...
[期刊论文] 作者：Hirotoshi Honma,Yoko Nakajima,,
来源：应用数学与应用物理(英文) 年份：2018
Given a simple graph G with n vertices and m edges, the spanning tree problem is to find a spanning tree for a given graph G. This problem has many applications...
相关搜索：
