a graph g 图g
simple graph g 简单图
semi-log g graph 半对数图
simplified derivability graph of G 简化的可派生性图表示
The path spectrum of a graph g, denoted by ps (g), is the set of length of all maximal paths in the graph.
如果图中的一条路不是其他任何路的子路,则称这条路为该图的一条极大路。
This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g,圈包装问题就是求g的边不相交圈的最大数目。
应用推荐