接连图 (connected graph)的树(tree)是一连接所有的节点但不构成环路 (loop) 的接连子图(connected subgraph) 。树的元件被称为枝 (branches)。
基于8个网页-相关网页
... 连接储存 connected storage 连接子图 connected subgraph 连接无向图 connected undirected graph ...
基于8个网页-相关网页
maximal connected subgraph 中最大的连通子图
maximum connected subgraph 连通子图
random connected subgraph 随机连通子图
strongly connected subgraph 强连通子图
connected subgraph in graph 图中的连通子图
connected spanning subgraph 连通支撑子图
We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.
本文研究图g的子图空间g上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。
The paper briefly introduces some graph theory methods such as maximal connected subgraph, maximal cliques, perfect match and graph spectral research which applied in prediction of protein structure.
该文简要介绍图的连通子图、图的最大团、图的完美匹配及图谱法在蛋白质结构预测中的应用。
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
应用推荐