n.[数]子图
网络 子图; 子图形; 子图表
Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.
清单 4 中的行 1 定义了名为 cluster_jhuapl.edu 的子图。
A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图,则称G是超欧拉的。
Frequent subgraph mining includes subgraph search and isomorphism problems.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Usually this occurs because a subgraph concerns a related set of functionality.
通常这个发生的原因是子图涉及到相关的一套功能。
Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.
然后,该算法被扩展来处理特殊的二分图查询。