graph theory
图论───graph theory
The purpose of this thesis is to collect the known results in graph theory with algebraic techniques involved.───这篇论文的目的主要是收集了已知的图论上使用的代数方法。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.───图的最小顶点覆盖问题是图论中的一个NP完全问题。
concept of square-free coloring was introduced in graph theory by Alon in 2002.───正方形着色的概念由阿龙在2002年引入图论。
The word association network of two cohorts of adults was studied respectively using graph theory and network analysis methods.───采用图论和网络分析方法对两组人群的词汇联想网络结构图进行比较。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.───利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Integration of the association rule mining algorithm FP-Tree and a great group theory, graph theory, the advantage.───融合了关联规则挖掘的FP-Tree算法和图论的极大团理论的优势。
Graph theory has around 300 years of history, but many problems haven't been solved.
Using graph theory, an achievable region of the uniquely decodable codes for the 3-user 2N-frequency noiseless multiple-access channel with intensity information is obtained.
Graph coloring is an important branch of graph theory.
There are three important graph polynomials in graph theory, they have a close relationship with each other: chromatic polynomial, Tutte polynomial and flow polynomial.
As a very important decision algorithm in graph theory, the optimization of the algorithm of depth first search tree will give an advantage to dealing with algorithm of other graph theory efficiently.