{"id":"https://openalex.org/W2610765673","doi":"https://doi.org/10.1109/istt.2016.7918095","title":"New mathematical model to find the shortest path based on Boolean algebra operations for networks","display_name":"New mathematical model to find the shortest path based on Boolean algebra operations for networks","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2610765673","doi":"https://doi.org/10.1109/istt.2016.7918095","mag":"2610765673"},"language":"en","primary_location":{"id":"doi:10.1109/istt.2016.7918095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istt.2016.7918095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 3rd International Symposium on Telecommunication Technologies (ISTT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013194420","display_name":"Abdalrazak Tareq Rahem","orcid":null},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Abdalrazak Tareq Rahem","raw_affiliation_strings":["Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061556312","display_name":"Mahamod Ismail","orcid":"https://orcid.org/0000-0002-5509-5735"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Mahamod Ismail","raw_affiliation_strings":["Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080151430","display_name":"Nor Fadzilah Abdullah","orcid":"https://orcid.org/0000-0002-6593-5603"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Nor Fadzilah Abdullah","raw_affiliation_strings":["Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074944852","display_name":"Ihab Ahmed Najm","orcid":"https://orcid.org/0000-0002-1834-5408"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ihab Ahmed Najm","raw_affiliation_strings":["Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Electronics and Systems Engineering, National University of Malaysia UKM","institution_ids":["https://openalex.org/I885383172"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I885383172"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"112","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9835000038146973,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9742000102996826,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7942783832550049},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.58266681432724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5699891448020935},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.564152181148529},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.5124502778053284},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.49603185057640076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4742431044578552},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.461848646402359},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.45909151434898376},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4533878266811371},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4528048038482666},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.45147672295570374},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4343162775039673},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.42624229192733765},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4189434349536896},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4006319046020508},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39784109592437744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3891139328479767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3633289337158203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33065080642700195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26003074645996094}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7942783832550049},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.58266681432724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5699891448020935},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.564152181148529},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.5124502778053284},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.49603185057640076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4742431044578552},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.461848646402359},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.45909151434898376},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4533878266811371},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4528048038482666},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.45147672295570374},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4343162775039673},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.42624229192733765},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4189434349536896},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4006319046020508},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39784109592437744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3891139328479767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3633289337158203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33065080642700195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26003074645996094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istt.2016.7918095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istt.2016.7918095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 3rd International Symposium on Telecommunication Technologies (ISTT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W579307044","https://openalex.org/W1570091341","https://openalex.org/W1619149558","https://openalex.org/W1986182860","https://openalex.org/W2003652380","https://openalex.org/W2042086777","https://openalex.org/W2090214865","https://openalex.org/W2095916892","https://openalex.org/W2110281342","https://openalex.org/W2152651316","https://openalex.org/W2153308163","https://openalex.org/W2609024314","https://openalex.org/W4285719527","https://openalex.org/W6676563154"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2133099431","https://openalex.org/W2002764510","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2183791707","https://openalex.org/W2186738974","https://openalex.org/W2612665926","https://openalex.org/W4294360851"],"abstract_inverted_index":{"A":[0],"common":[1],"question":[2],"concerning":[3],"the":[4,11,63,78],"graph":[5],"theory":[6],"is":[7,86],"how":[8],"to":[9,34,49,61,76],"find":[10,35],"shortest":[12,64],"paths":[13],"between":[14],"two":[15],"vertices,":[16],"thus":[17],"covering":[18],"a":[19,57],"wide":[20],"range":[21],"of":[22],"research":[23],"areas.":[24],"So":[25],"far,":[26],"almost":[27],"all":[28],"previous":[29],"studies":[30],"have":[31],"used":[32],"Algorithms":[33],"such":[36],"path.":[37],"However,":[38],"this":[39,54],"consumes":[40],"more":[41,51],"or":[42],"large":[43],"search":[44,79],"spaces,":[45],"and":[46,81,88],"it":[47],"tends":[48],"be":[50],"complex.":[52],"Therefore,":[53],"paper":[55],"presents":[56],"new":[58],"mathematical":[59],"method":[60,71,85],"finding":[62],"path":[65],"in":[66],"an":[67],"undirected":[68],"graph.":[69],"The":[70],"involves":[72],"only":[73],"Boolean":[74],"algebra":[75],"reduce":[77],"space":[80],"computational":[82],"complexity.":[83],"This":[84],"simple":[87],"even":[89],"faster":[90],"than":[91],"linear":[92],"programming.":[93]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}