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

Abdalrazak Tareq Rahem, Mahamod Ismail, Nor Fadzilah Abdullah, Ihab Ahmed Najm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publication2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages112-114
Number of pages3
ISBN (Electronic)9781509054312
DOIs
Publication statusPublished - 2 May 2017
Event3rd IEEE International Symposium on Telecommunication Technologies, ISTT 2016 - Kuala Lumpur, Malaysia
Duration: 28 Nov 201630 Nov 2016

Other

Other3rd IEEE International Symposium on Telecommunication Technologies, ISTT 2016
CountryMalaysia
CityKuala Lumpur
Period28/11/1630/11/16

Fingerprint

Boolean algebra
Graph theory
Linear programming
Computational complexity
mathematical models
Mathematical models
graph theory
linear programming
apexes
coverings

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Instrumentation

Cite this

Rahem, A. T., Ismail, M., Abdullah, N. F., & Najm, I. A. (2017). New mathematical model to find the shortest path based on Boolean algebra operations for networks. In 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.

2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 112-114 7918095.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahem, AT, Ismail, M, Abdullah, NF & Najm, IA 2017, New mathematical model to find the shortest path based on Boolean algebra operations for networks. in 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
Rahem AT, Ismail M, Abdullah NF, Najm IA. New mathematical model to find the shortest path based on Boolean algebra operations for networks. In 2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 112-114. 7918095 https://doi.org/10.1109/ISTT.2016.7918095
Rahem, Abdalrazak Tareq ; Ismail, Mahamod ; Abdullah, Nor Fadzilah ; Najm, Ihab Ahmed. / New mathematical model to find the shortest path based on Boolean algebra operations for networks. 2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 112-114
@inproceedings{37ee755ea46349c496269c4f7c24b279,
title = "New mathematical model to find the shortest path based on Boolean algebra operations for networks",
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.",
keywords = "Adjacency matrix, Boolean algebra, graph theory, shortest path",
author = "Rahem, {Abdalrazak Tareq} and Mahamod Ismail and Abdullah, {Nor Fadzilah} and Najm, {Ihab Ahmed}",
year = "2017",
month = "5",
day = "2",
doi = "10.1109/ISTT.2016.7918095",
language = "English",
pages = "112--114",
booktitle = "2016 IEEE 3rd International Symposium on Telecommunication Technologies, ISTT 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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 -