graph造句
151. The path graph transformation is a natural and interesting generalization of line graph transformation.
152. There are three important graph polynomials in graph theory, they have a close relationship with each other: chromatic polynomial, Tutte polynomial and flow polynomial.
153. This curtain in the graph is done not have flatly pensile, and make its lumpy , and respect of colour and lustre uses warm color, give a person with decorous and flow, warm feeling.
154. In this paper, three measure of the connectedness of a fuzzy graph:fuzzy connectivity, fuzzy edge connectivity, fuzzy nuclearity and their properties are presented.
155. In this context a graph is hardly more than a visual or computational aid.
156. In essence, 3D ventilation network graph is a 'figurative' ventilation network graph, and it surpasses the technical level of the conventional planar network graph.
157. To support causal analysis, extended event graph(EEG) is put forward to rebuild the events and their causal relations happened in simulation.
158. Firstly, it trains a set of classifiers and constructs a complete undirected graph with weight by using individual and diversity value between individuals.
159. Second, the principal graph algorithm is adopted to generate skeleton line of zebrafish embryos based on the idea of principal curves.
160. The inheritance hierarchy is a actually a directed acyclic graph.
161. In respect that the graph model itself is graph or can be transformed as graph by some method, the graph transformation is highly fit for graph model transforming.
162. Graph of changed scope of compliance about renal participating in compensatory adjustment were drawn out in chronic respiratory acidosis and alkalosis separately.
163. From the transfer function of the system, and transform the signal flow graph to its log-domain form, then use the corresponding log-domain circuit to realize the log-domain filtering.
164. The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph.
165. set size is also useful in conjunction with the multiplot command, which is used to produce more than one graph on the same output screen or file.
166. This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
167. Then the paper brings forward the overset relationship graph to deal with the problems brought by multi-level overset grids.
168. The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
169. Gives the infimum of the numbers of dege in 2 - connected nontrivial geodetic graph; Renew some results.
170. However, the motion graph method has its inherent fault which the efficiency and functional of generated movements subject to its original motion capture database.
171. A cyclic object graph cannot be transformed into a tree structure.
172. By discussing two different conditions of double-cycles graph, chromatic polynomial on double-cycles graph is solved.
173. The best way to draw a line graph is to use an SVG element called the polyline. The polyline takes in pairs of values as X and Y points and draws a connecting line between the points.
174. For inter-ring demands, we propose an algorithm based on auxiliary graph, which ensures the success rate of demand assignment.
175. This paper describes the method of analysis of active circuits including nullors with signal flow graph.
176. According to the characteristics of the ICAI knowledge, the concept of knowledge structure AND/OR graph is presented by researching the two main relationships among knowledge points.
177. It has raw log, tabulated data, and graph views, and can save data to jpeg or .csv files (for export to spreadsheets).
178. HMO characteristic polynomial and select eigenvalues for many heterocyclic benzenoids are calculated by using chemical graph theory methods.
179. This visualizer creates a graph of data on an x-y axis to help spot outliers.
180. Finding obstacle-avoiding shortest path is an important problem in VLSI design, and connection graph is a fundamental tool to resolve the problem.
12345678