Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint

1998 ◽  
Vol 34 (1) ◽  
pp. 77-85
Author(s):  
A. Sh. Nepomnyashchaya
Keyword(s):  
Spanning Tree ◽  
Node Degree ◽  
Degree Constraint

Survivable Virtual Optical Network Coordinated Mapping with Local Backup

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Danping Ren ◽  
Wei Wang ◽  
Jinhua Hu ◽  
Jijun Zhao
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Blocking Probability ◽  
Optical Network ◽  
Mapping Method ◽  
Resource Consumption ◽  
Node Degree ◽  
Network Resource ◽  
Mapping Algorithm ◽  
Degree Constraint

AbstractSurvivable virtual optical network (VON) mapping is researched to overcome the ossification of current network architectures. In this paper, we study the survivable VON mapping problem in elastic optical network (EON) with the objective of minimizing the average resource consumption of VON request. We propose a protective algorithm, namely, coordinated mapping algorithm based on minimum spanning tree (CMST), to provide the dedicated protection against the single physical link failure. In CMST, for virtual node mapping, we not only consider the resources constraint but also the node degree constraint. For virtual link mapping, we adopt the coordinated mapping method for part of the virtual nodes and virtual links. And we provide the backup path for the minimum spanning tree link of virtual topology to reduce the resource consumption. Simulation results showed that CMST can reduce the VON request blocking probability and average network resource consumption. And it can increase the revenue of physical network.

Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm

2014 ◽  
Vol 687-691 ◽  
pp. 1250-1253
Author(s):  
Lu Si Liu
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Random Search ◽  
Node Degree ◽  
Improved Genetic Algorithm ◽  
Theory Of Evolution ◽  
Research On Application ◽  
Almost All

Nowadays, the game industry has entered a period of vigorous development, each game artificial intelligence has become the indispensable one element, so a good design can be seen as the soul of game, in almost all games have a kind of be good to hear or see appearance, the soul is attracted to the core game player. In this paper, the genetic algorithm becomes a new random search and optimization algorithm, the basic idea of the theory of evolution based on Darwin and Mendel genetics. Genetic algorithm for solving multi objective and complexity with the unpredictable nature of the problem, there is there is nothing comparable to this superiority. The shortest path problem of network is abstracted to a minimum spanning tree problem and the limitations of the minimum spanning tree are analyzed. The notion of the node degree is introduced.

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

Networks ◽  
2011 ◽  
Vol 60 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Christophe Duhamel ◽  
Luís Gouveia ◽  
Pedro Moura ◽  
Maurício de Souza
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Node Degree ◽  
Minimum Spanning Tree Problem

WALKING IN AN ARRANGEMENT TOPOLOGICALLY

1994 ◽  
Vol 04 (02) ◽  
pp. 123-151 ◽  
Author(s):  
TETSUO ASANO ◽  
LEONIDAS J. GUIBAS ◽  
TAKESHI TOKUYAMA
Keyword(s):  
Spanning Tree ◽  
Dual Graph ◽  
Node Degree ◽  
Convex Region ◽  
K Cells ◽  
Working Space ◽  
On Line

We present topological walk, an on-line algorithm for computing a walk in an arrangement. Here, a walk is a visit to the cells of an arrangement in an order such that consecutive cells are adjacent to each other. The algorithm can walk in a part of an arrangement efficiently; more precisely, given an arrangement of n lines in a convex region containing K cells, a walk is performed in O(K + n log n) time and O(n) working space. Several optimal-cell-finding problems can be solved efficiently applying the topological walk. Further, a construction of a spanning tree with maximum node degree three of the dual graph of an arrangement is given.

Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure

2009 ◽  
Vol E92-B (3) ◽  
pp. 909-921
Author(s):  
Depeng JIN ◽  
Wentao CHEN ◽  
Li SU ◽  
Yong LI ◽  
Lieguang ZENG
Keyword(s):  
Spanning Tree ◽  
Recovery Scheme
Sign in / Sign up

Export Citation Format

Share Document