A Study on Improved MRMF Algorithm on Uncertain Graph

2020 ◽  
pp. 124-133
Author(s):  
Kejie Wen ◽  
Juan Yang ◽  
Wei Liu ◽  
Yanchun Yang ◽  
Baili Zhang
Keyword(s):  
Uncertain Graph

Algorithms of the Most Reliable Maximum Flow on Uncertain Graph

2012 ◽  
Vol 35 (11) ◽  
pp. 2371
Author(s):  
Wei CAI ◽  
Bai-Li ZHANG ◽  
Jian-Hua LV
Keyword(s):  
Maximum Flow ◽  
Uncertain Graph

An uncertain chromatic number of an uncertain graph based on $$\alpha $$ α -cut coloring

2016 ◽  
Vol 17 (1) ◽  
pp. 103-123 ◽  
Author(s):  
Isnaini Rosyida ◽  
Jin Peng ◽  
Lin Chen ◽  
Widodo Widodo ◽  
Ch. Rini Indrati ◽  
...  
Keyword(s):  
Chromatic Number ◽  
Uncertain Graph

The computation on $$\alpha $$ α -connectedness index of uncertain graph

2017 ◽  
Vol 22 (S3) ◽  
pp. 5691-5701 ◽  
Author(s):  
Xiulian Gao ◽  
Changyou Guo ◽  
Xiuling Yin ◽  
Xuedou Yu
Keyword(s):  
Uncertain Graph

scholarly journals Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
YiHua Zhong ◽  
ShiMing Luo ◽  
Min Bao ◽  
XiaoDie Lv
Keyword(s):  
Dynamic Programming ◽  
Programming Model ◽  
Network Planning ◽  
Dynamic Network ◽  
Planning Problem ◽  
Uncertainty Measure ◽  
Uncertain Graph ◽  
Logistics System ◽  
Nanjing City ◽  
Dynamic Programming Model

When designing the underground logistics system, it is necessary to consider the uncertainty of logistics nodes, high cost, and high risk. This paper employed the theories of uncertain graph and dynamic programming to solve the network planning problem of underground logistics system. Firstly, we proposed the concepts of uncertainty measure matrix and vertices structure uncertainty graph by using uncertainty measure and uncertainty graph. Secondly, vertices structure uncertainty graph of the underground logistics system was constructed based on our proposed vertices structure uncertainty graph and the uncertainty of logistics nodes. Thirdly, the dynamic programming model of the underground logistics system was established, and its solution algorithm was also designed by improving simulated annealing. Finally, the correctness and feasibility of the method was validated by using a numerical example of the underground logistics system in Xianlin district, Nanjing City in China.

CONNECTEDNESS INDEX OF UNCERTAIN GRAPH

2013 ◽  
Vol 21 (01) ◽  
pp. 127-137 ◽  
Author(s):  
XIULIAN GAO ◽  
YUAN GAO
Keyword(s):  
Graph Theory ◽  
Uncertainty Theory ◽  
Graph Connectivity ◽  
Uncertain Graph ◽  
Practical Applications

In practical applications of graph theory, non-deterministic factors are frequently encountered. This paper employs uncertainty theory to deal with non-deterministic factors in problems of graph connectivity. The concepts of uncertain graph and connectedness index of uncertain graph are proposed in this paper. It presents two algorithms to calculate connectedness index of an uncertain graph.

Uncertain Graph Processing through Representative Instances

2015 ◽  
Vol 40 (3) ◽  
pp. 1-39 ◽  
Author(s):  
Panos Parchas ◽  
Francesco Gullo ◽  
Dimitris Papadias ◽  
Francesco Bonchi
Keyword(s):  
Graph Processing ◽  
Uncertain Graph
Sign in / Sign up

Export Citation Format

Share Document