New Mathematical model to find the shortest path based on Boolean algebra operations for networks

被引：0

作者：

Rahem, Abdalrazak Tareq ^{[1
]}

Ismail, Mahamod ^{[1
]}

Abdullah, Nor Fadzilah ^{[1
]}

Najm, Ihab Ahmed ^{[1
]}

机构：

[1] Natl Univ Malaysia UKM, Fac Engn & Built Environm, Dept Elect Elect & Syst Engn, Bangi, Malaysia

来源：

2016 IEEE 3RD INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATION TECHNOLOGIES (ISTT) | 2016年

关键词：

shortest path; graph theory; Boolean algebra; Adjacency matrix; GRAPH; MATRIX;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A common question concerning the graph theory is how to find the shortest paths between two vertices, thus covering a wide range of research areas. So far, almost all previous studies have used Algorithms to find such path. However, this consumes more or large search spaces, and it tends to be more complex. Therefore, this paper presents a new mathematical method to finding the shortest path in an undirected graph. The method involves only Boolean algebra to reduce the search space and computational complexity. This method is simple and even faster than linear programming.

引用

页码：112 / 114

页数：3

共 13 条

[1]

[Anonymous], 2007, Semi-tensor product of matrices-Theory and applications

[2] ON FINDING SIMPLE PATHS AND CIRCUITS IN A GRAPH [J].

DANIELSON, GH .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1968, CT15 (03) :294-+

[3]

Donoso R. F. Yezid, 2010, MULTIOBJECTIVE OPTIM

[4]

Lee S, 2008, LECT NOTES ARTIF INT, V4953, P203

[5] A matrix-based fast calculation algorithm for estimating network capacity of MANETs [J].

Li, N ;

Guo, Y ;

Zheng, SR ;

Tian, C ;

Zheng, J .

2005 SYSTEMS COMMUNICATIONS, PROCEEDINGS: ICW 2005, WIRELESS TECHNOLOGIES; ICHSN 2005, HIGH SPEED NETWORKS; ICMCS 2005, MULTIMEDIA COMMUNICATIONS SYSTEMS; SENET 2005, SENSOR NETWORKS, 2005, :407-412

[6] A Routing Protocol based on Distance Vector in Ad Hoc Networks [J].