查询词典 planar graph

In 1987, the well-know mathematician Yousef Alavi and other famous mathematicians defined a new decomposition of graph-Ascending Subgraph Decomposition which is on the condition of proper subgraph isomorphic, and in the same paper they proposed the following ASD conjecture: every graph of positive size has an ASD.

升分解(ascending subgraph decomposition，简记为ASD)是1987年闻名世界的数学家Alavi与其他几位著名数学家给出的一种在真子图同构意义下的图的新分解，并且在同一论文中他们还提出了一个升分解猜想：任意有正数条边的图都可升分解。

It is known that with the development of graph theory in the mathematical field, the research value of Hamilton-graphs in graph theory is much more protuberant than before.

此外，本文还研究了在小阶图中是否存在3-正则4-可序哈密尔顿图的问题。

Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.

将两种基于图论的算法图切割与随机游走应用于运动对象的分割。

A chart or graph .A line representing data on a graph .

图表上的曲线突降之後逐渐趋於平稳。

Evolution operations on development systems can be naturally expressed by graph rewriting rules. An evolution step is a concrete derivation of a rewriting rule from the graph representing the development system.

在此基础上，我们考察了软件工程中的各种对象在具体图模型上的表示，以及对象间的各种横向和纵向联系。

A line representing data on a graph .The graph flattens out gradually after a steep fall.

背单词诀窍，只需每天5分钟 TEM-8 历年真题1999-2009下载大学英语六级最新历年题在线测试

With the theory of bond graph, the bond graph models of extension mode and retraction mode were established.

应用键合图理论，建立了液压缸伸出和缩进两个工况的键合图模型。

This study presents a new multilayer implicit connection graph-based gridless router called NEMO. Unlike the first implicit connection graph-based router that embeds all routing layers onto a routing plane, NEMO constructs a routing plane for each routing layer.

这个研究提出一个新的以隐性连通图为基础的多层非格子绕线器尼摩，它不像之前第一个以隐性连通图为基础的绕线器埋置所有层到一个绕线平面，尼摩一个绕线层就建构一个绕线平面。

On the graph paper below, draw a graph of distance against time for Rowena's run.

a 在下图中画出Rowena快速跑的路程－时间图象。

The shortest path approximation algorithm builds a weighted graph from the given set of scattered points using the distribution of these data points. By computing the shortest path in the weighted graph, the problem of curve reconstruction from scattered data points is transformed into that of curve reconstruction from a set of ordered data points.

最短路逼近算法首次将图论中最短路径理论引入到曲线重建中，根据散乱数据点的分布构造带权连通图，通过求解带权连通图的最短路径，将散乱数据点集的曲线重建问题转化为有序数据点集的曲线重建问题。

The teacher likes the honeymouthed little girl very much.

老师很喜欢这个嘴甜的小姑娘。

Mr. Notker Bien's interests are traveling, spending quality time with the family and long-distance-running.

诺特卡·柏恩先生热爱旅游，长跑，以及和家人一起共度美好时光。