### Abstract

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.

Original language | English |
---|---|

Title of host publication | 2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 112-114 |

Number of pages | 3 |

ISBN (Electronic) | 9781509054312 |

DOIs | |

Publication status | Published - 2 May 2017 |

Event | 3rd IEEE International Symposium on Telecommunication Technologies, ISTT 2016 - Kuala Lumpur, Malaysia Duration: 28 Nov 2016 → 30 Nov 2016 |

### Other

Other | 3rd IEEE International Symposium on Telecommunication Technologies, ISTT 2016 |
---|---|

Country | Malaysia |

City | Kuala Lumpur |

Period | 28/11/16 → 30/11/16 |

### Fingerprint

### Keywords

- Adjacency matrix
- Boolean algebra
- graph theory
- shortest path

### ASJC Scopus subject areas

- Computer Networks and Communications
- Instrumentation

### Cite this

*2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016*(pp. 112-114). [7918095] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISTT.2016.7918095

**New mathematical model to find the shortest path based on Boolean algebra operations for networks.** / Rahem, Abdalrazak Tareq; Ismail, Mahamod; Abdullah, Nor Fadzilah; Najm, Ihab Ahmed.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016.*, 7918095, Institute of Electrical and Electronics Engineers Inc., pp. 112-114, 3rd IEEE International Symposium on Telecommunication Technologies, ISTT 2016, Kuala Lumpur, Malaysia, 28/11/16. https://doi.org/10.1109/ISTT.2016.7918095

}

TY - GEN

T1 - New mathematical model to find the shortest path based on Boolean algebra operations for networks

AU - Rahem, Abdalrazak Tareq

AU - Ismail, Mahamod

AU - Abdullah, Nor Fadzilah

AU - Najm, Ihab Ahmed

PY - 2017/5/2

Y1 - 2017/5/2

N2 - 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.

AB - 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.

KW - Adjacency matrix

KW - Boolean algebra

KW - graph theory

KW - shortest path

UR - http://www.scopus.com/inward/record.url?scp=85019713520&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019713520&partnerID=8YFLogxK

U2 - 10.1109/ISTT.2016.7918095

DO - 10.1109/ISTT.2016.7918095

M3 - Conference contribution

SP - 112

EP - 114

BT - 2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -