arborescence

With the expansion of information visualization applications, requirement of the control over the length of edges appears in the drawing of weighted arborescence.

随着信息可视化技术应用范围的扩大，赋权树形图的绘制过程中常常需要对边的长度进行限定。

This paper gives an efficient algorithm to find an arc constrained optimum arborescence.

本文给出了求弧约束最优树形图的一个有效算法。

This paper develops Zhu-Liu algorithm [ 1] to the minimum spanning arborescence with bi-weight and deduce and polynominal algorithm with O ( mn) complexity using lexicographic order.

本文在朱－刘算法的基础上，讨论了网络双权最小树形图问题.采用字典序方法得到了该问题的一个复杂性为O（mn）的多项式算法。

The weighted shortest path arborescence game. A DNA Solution to Weighted Hamilton Path Problem

加权最短路树形图对策问题。赋权Hamilton路的DNA计算模型

A Simple Algorithm for Finding the Minimum Arborescence in a Network

在网络中寻找最小树形图的简易算法

New Thought of "Arborescence Structure" about Teaching

树状结构教学新思路

In this paper, we study the properties of the spanning arborescence in a network, and propose a simple algorithm for finding the minimum arborescence in a network, we also discuss the complexity of this algorithm and present an example for applying this algorithm.

研究网络中支撑树形图的性质，提出了在网络图中寻找最小树形图的简易算法，并对算法的复杂性进行了讨论，还给出应用该算法进行计算的一个实际算例。

The models of shortest path arborescence game and weighted shortest path arborescence game are established and the imputations of this cooperative game in many cases are obtained.

建立了最短路树形图对策和加权最短路树形图对策模型，并求出了此对策问题在多种意义下的分配。

A Polynomial Algorithm for Double-Weight Arborescence

双权树形图的多项式算法

Results: Tracheas, left and right main bronchi, upper and lower lobar bronchi, and partial segmental bronchi were like as arborescence displayed on the same plane.

结果：气管、左右主支气管、上下叶支气管，以及部分段支气管呈树枝状被显示在同一层面上。

A Method of Drawing Weighted Arborescence in Information Visualization

信息可视化中赋权树形图的绘制实现方法

Arc Constrained Optimum Arborescence

弧约束最优树形图问题

Nutritive composition and efficiency of aloe arborescence Miller

木立芦荟营养成分与功效

Thus passed the leafy time when arborescence seems to be the one thing aimed at out of doors.

当树木似乎变成户外最集中的事物时，树叶生长的季节就这样过去了。

On the algorithm of shortest arborescence Little Telescope

最小树形图的一个算法

Single load shifting of power distribution systems based on shortest path arborescence

基于最短路径的配电网单负荷转移

A high-efficient algorithm to seek the shortest path arborescence and all shortest paths between any two vertices in DAG is presented.

无回路网络是一类重要的网络，给出在无回路网络中求解最短路树形图和任意顶点对间最短路的高效算法。