End-to-end details - Each layer of the graph can be viewed to provide a complete breakdown of where time was spent.
端到端详细信息：可以查看图片的每一层，提供在哪儿花费了多少时间的详细说明。
This graph displays the complete results of the study.
下图显示了研究完整的结果。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The bond graph method for the complete dynamic problem of mechanical system is introduced. The unified formula of system state-space equations is derived.
介绍了机械系统完全动力学问题的键合图法，推导出系统状态方程的统一公式。
A complete set of layered structure design is set forth to implement the multi graph display and multi layer management functions of network.
提出了一套完整的层次结构设计方案综合实现网络的多图显示与分层管理功能。
This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。
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.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph.
并确定了路、圏和完全多部图的控制临界数的精确值。
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple complete graph is put forward.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
It has many applications in CAD. It is proved that the problem of determining the crossing number of an arbitrary graph is NP-complete.
图的交叉数问题是在实际应用中提出来的，在CAD领域有广阔的应用。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
The first chapter is about graph-directed self-similar sets in complete metric spaces, and the second chapter is about multifractal analysis of equilibrium measures in dynamical systems.
其中第一章是关于度量空间中的图定向自相似集合，第二章是关于动力系统中平衡态测度的重分形分析。
In this paper the total chromatic conjecture is verified to be true for complete 4-partite graph.
本文对所有4部完全图证实了全着色猜想。
In this paper, some properties regarding the chromatic polynomials of graph on the complete-graph-basis and the chromaticity of some graphs by complete-graph - basis are discussed.
文章讨论了建立在完全图基上的色多项式的若干性质。并利用完全图基讨论了一些多边图的色性。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
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.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。
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.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。
应用推荐