An orientation of a complete graph is called a tournament.
完全图的定向图称为竞赛图。
Level diagram example shows the practicality and effectiveness of the construction theorem and counting theorem, which is a simple and easy method to construct a complete graph of the spanning tree.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。
End-to-end details - Each layer of the graph can be viewed to provide a complete breakdown of where time was spent.
端到端详细信息：可以查看图片的每一层，提供在哪儿花费了多少时间的详细说明。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
A complete set of layered structure design is set forth to implement the multi graph display and multi layer management functions of network.
提出了一套完整的层次结构设计方案综合实现网络的多图显示与分层管理功能。
A complete bipartite graph is a simple bipartite graph with bipartition.
完全偶图是具有二分类的简单偶图。
This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
By inserting a new set of medium vertices in a complete bipartite graph, we extend Pigeon-hole formula to general pigeon-hole formula.
鸽巢公式的一个真值指派可以用一个边带标记的完全二分图表示。
The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph.
并确定了路、圏和完全多部图的控制临界数的精确值。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A complete database software is a comprehensive engineering software that includes functions such as database searching, maintenance and calculation, graph-drawing and process simulation.
完整的数据库软件是包含数据查询、数据维护、数据计算、图形绘制、以及过程模拟等功能的综合工程软件。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
应用推荐