加权图

仿真结果表明，Petri网方法是一种有效的计算加权图最大流量的方法。

Simulation results showed that the Petri net method is efficient to calculate the maximum flow of the weighted graph .

本文研究了以最小或近似最小权值的边集扩充一个任意无向加权图为K边连通图，文中给出了一个近似算法，为网络的可靠性设计和改建提供了一个新方法。

An approximation algorithm is presented for augmenting an undirected weighted graph to a K-edge-connected graph . The algorithm is useful for designing a realizable network .

无向加权图的K点连通扩充算法

A K - Vertex - Connected Augmentation Algorithm for Undirected Weighted Graphs

任意无向加权图K点连通扩充的模拟退火算法

Simulated annealing algorithm for K-vertex-connected augmentation on the arbitrary undirected weighted graph

然后成功地将模拟退火方法应用于任意无向加权图的K点连通扩充问题，提出了一个O（ΩKV~4）的近似算法，为解决加权图的扩充问题提供了一种新途径。

An approximation algorithm of O ( OK | V | 4 ) is presented , which provides a new approach for the augmentation problem of weighted graphs .

RDF是语义Web建立的基础：将数据表示成有向加权图的一种标准。

RDF serves as the foundation upon which the Semantic Web is built : it is a standard to represent data as a directed , labeled graph .

探讨了基于有向加权图的STL文件数据模型的分层算法并给出了典型零件的分层切片实例。

The algorithm of slicing STL data model on the basis of the oriental factor diagram is illustrated . And the slicing examples of typical work-pieces are given .

首先从实际网络中抽取出其中的网络拓扑模型，并将OSPF网络定义为一个有向加权图。

Firstly , this paper gets out the abstract network topology model of the real network , and defines the OSPF network as a weighted directed gragh .

该算法首先将抽取网页结构和视觉信息构造一个无向加权图，其中图的顶点是网页DOM树中的可视叶子节点，图的边为浏览器中显示的节点位置关系。

The algorithm firstly distills vision and structure information from a web page to construct a weighted undirected graph , whose vertices are the leaf nodes of the DOM tree and the edges represent the visible position relationship between vertices .

基于加权图的地籍时空数据描述模型研究

Spatio-Temporal Data Model in Cadastral Information System Based on Weighted Graph

分子加权图的拓扑结构

Topological Structure of Molecule Weight Graph

本文用加权图的语言给出了这个充要条件一个简单的组合论的刻画。

This paper reduced Qiu s criterion to a simpler version in terms of weighted graphs .

并生成一个有向加权图，直观展示世界武器贸易状况。

And generate a directed weighted graph , intuitive picture of the world arms trade situation . 3 .

在该结构基础上，提出了基于加权图的复杂性评价模型，并结合实例分析了模型的使用效果。

Based on the software architecture , proposed weighted graph based evaluation model for complexity , with an example to be analyzed and explained how to use the model .

将超文本系统看成是一种有向加权图，经过对可信度和支持度的重新定义，使之适合于用来表示用户的访问路径，并引出复合关联规则挖掘算法。

In the article , the hypertext system is regarded as a weighted graph and the composite association rule mining method is proposed after the redefinition of the confidence and support .

基于投影加权Voronoi图的GIS空间竞争分析模型研究

A Study of GIS Spatial Competition Analysis Model Based on Projective Weighted Voronoi Diagrams

GIS中投影加权Voronoi图及竞争三角形生成算法研究

Study on the Algorithm for Creating Projective Weighted Voronoi Diagrams and Competitive Triangles in GIS

分区加权Voronoi图的生成及其面积计算

The Construction of Divisional Weighted Voronoi Diagrams and Count of Area

基于加权Voronoi图的城市影响范围划分

Delimitation of central cities influenced regions based on weighted-Voronoi diagram

基于加权Voronoi图的城市地震应急避难场所责任区的划分

Weighted Voronoi Diagrams for Responsibility Space Regionalization of Urban Earthquake Emergency Shelters

传感器网络中基于加权Voronoi图的能量均衡数据采集算法

Energy-Balancing Data Collection Based on the Multiplicatively Weighted Voronoi Diagram in Sensor Networks

线段加权Voronoi图的离散生成算法的研究与实现

On discrete construction algorithm of line segment weighted Voronoi diagram and its realization

基于加权Voronoi图的城市经济区划分方法探讨

A study on the division of urban economic regions based on weighted Voronoi diagram

基于网络加权Voronoi图分析的南京市商业中心辐射域研究

Radiation Domain of Commercial Centers in Nanjing Based on Analysis of Road Network Weighted Voronoi Diagram

基于Relly法则与加权Voronoi图的连锁超市商圈分析

A Chain Store Trade Area Analysis Based on Voronoi Diagram and Relly Law

第三，考虑到加权Voronoi图在空间分割中的合理性，计算机自动生成的可行性，运用加权Voronoi图对河南省38个城市（市区）的综合影响力进行了分析。

The third , considering of the rationality in spatial division with Voronoi diagram , an analysis in the spatial influences of the 38 cities was given .

提出加权Voronoi图的一种新形式&投影加权Voronoi图，由此形成平面剖分中的空隙（竞争三角形）可用于GIS空间竞争分析模型。

A new form of weighted Voronoi diagrams named Projective Weighted Voronoi Diagram ( PWVD ) is introduced . Thus the interspace produced by tessellation can be used in GIS spatial competition analysis model .

通过构建两种不同形式的加权Voronoi图，提出了确定区域中心城市和划分城市经济区的新方法，并以河南省为例进行了实证分析。

The paper put forward new methods for selecting regional central cities and dividing urban economic regions by means of two kinds of weighted Voronoi diagrams , and gave an analytic demonstration taking Henan province as an example .

通过深入分析城市断裂点理论的性质，并应用加权Voronoi图对其扩展，发现了包括传统断裂点在内的城市吸引范围的理论上的准确边界，提出了“断裂弧”的概念。

The exact boundary of each city 's absorbed region in theory is found and the conception of breaking arc was put forward by analyzing the breaking point theory deeply , and expanding the theory with weighted Voronoi diagram .

针对变电站优化规划这一城市电网规划工作中的重要环节，提出了一种基于加权Voronoi图的变电站规划方法，可以最终完成对变电站数量、容量、站址及供电范围的优化。

Substation optimization planning plays an important role in urban network planning . This paper presents a novel method for substation planning based on the weighted Voronoi diagram , which can optimize the number , capacity , location , size and power supply area of substations .