{"id":"https://openalex.org/W2087932760","doi":"https://doi.org/10.1145/1838002.1838079","title":"An edge-wise linear shortest path algorithm for non negative weighted undirected graphs","display_name":"An edge-wise linear shortest path algorithm for non negative weighted undirected graphs","publication_year":2009,"publication_date":"2009-12-16","ids":{"openalex":"https://openalex.org/W2087932760","doi":"https://doi.org/10.1145/1838002.1838079","mag":"2087932760"},"language":"en","primary_location":{"id":"doi:10.1145/1838002.1838079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1838002.1838079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th International Conference on Frontiers of Information Technology","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/A5091812586","display_name":"Muhammad Aasim Qureshi","orcid":"https://orcid.org/0000-0002-6312-5797"},"institutions":[{"id":"https://openalex.org/I182023848","display_name":"Petronas (Malaysia)","ror":"https://ror.org/02tc7rm90","country_code":"MY","type":"company","lineage":["https://openalex.org/I182023848"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"M. Aasim Qureshi","raw_affiliation_strings":["Universiti. Technologi, Petronas, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiti. Technologi, Petronas, Malaysia","institution_ids":["https://openalex.org/I182023848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079884366","display_name":"Mohd Fadzil Hassan","orcid":"https://orcid.org/0000-0001-9912-6890"},"institutions":[{"id":"https://openalex.org/I182023848","display_name":"Petronas (Malaysia)","ror":"https://ror.org/02tc7rm90","country_code":"MY","type":"company","lineage":["https://openalex.org/I182023848"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Mohd Fadzil Hassan","raw_affiliation_strings":["Universiti. Technologi, Petronas, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiti. Technologi, Petronas, Malaysia","institution_ids":["https://openalex.org/I182023848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108348567","display_name":"Sohail Safdar","orcid":null},"institutions":[{"id":"https://openalex.org/I182023848","display_name":"Petronas (Malaysia)","ror":"https://ror.org/02tc7rm90","country_code":"MY","type":"company","lineage":["https://openalex.org/I182023848"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Sohail Safdar","raw_affiliation_strings":["Universiti. Technologi, Petronas, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiti. Technologi, Petronas, Malaysia","institution_ids":["https://openalex.org/I182023848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044145790","display_name":"Rehan Akbar","orcid":null},"institutions":[{"id":"https://openalex.org/I182023848","display_name":"Petronas (Malaysia)","ror":"https://ror.org/02tc7rm90","country_code":"MY","type":"company","lineage":["https://openalex.org/I182023848"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Rehan Akbar","raw_affiliation_strings":["Universiti. Technologi, Petronas, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiti. Technologi, Petronas, Malaysia","institution_ids":["https://openalex.org/I182023848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079095275","display_name":"Rabia Sammi","orcid":null},"institutions":[{"id":"https://openalex.org/I200749728","display_name":"Pir Mehr Ali Shah Arid Agriculture University","ror":"https://ror.org/035zn2q74","country_code":"PK","type":"education","lineage":["https://openalex.org/I200749728"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Rabia Sammi","raw_affiliation_strings":["UIIT, PMAS Arid Agriculture University, Rawalpindi, Pakistan","UIIT - PMAS- Arid Agriculture University, Rawalpindi, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UIIT, PMAS Arid Agriculture University, Rawalpindi, Pakistan","institution_ids":["https://openalex.org/I200749728"]},{"raw_affiliation_string":"UIIT - PMAS- Arid Agriculture University, Rawalpindi, Pakistan","institution_ids":["https://openalex.org/I200749728"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7735069990158081},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7721109390258789},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.75848388671875},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.7165328860282898},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6640251874923706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6296095848083496},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6114938855171204},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.5353240370750427},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4985835552215576},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4899698793888092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4894925355911255},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.48749780654907227},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4713304042816162},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4455721974372864},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4108807146549225},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40487366914749146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34405702352523804},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3184557557106018},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2687928080558777},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.26428142189979553},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17700240015983582},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1316147744655609},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10908046364784241}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7735069990158081},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7721109390258789},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.75848388671875},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7165328860282898},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6640251874923706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6296095848083496},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6114938855171204},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.5353240370750427},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4985835552215576},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4899698793888092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4894925355911255},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.48749780654907227},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4713304042816162},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4455721974372864},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4108807146549225},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40487366914749146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34405702352523804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3184557557106018},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2687928080558777},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26428142189979553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17700240015983582},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1316147744655609},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10908046364784241},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1838002.1838079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1838002.1838079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th International Conference on Frontiers of Information Technology","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":17,"referenced_works":["https://openalex.org/W1511146167","https://openalex.org/W1599325086","https://openalex.org/W1993675440","https://openalex.org/W1999545213","https://openalex.org/W2010802092","https://openalex.org/W2018338704","https://openalex.org/W2025082755","https://openalex.org/W2074286662","https://openalex.org/W2075543862","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2129776415","https://openalex.org/W2160365857","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2741557789","https://openalex.org/W2798490245"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2009987517","https://openalex.org/W4200172719","https://openalex.org/W2161960576","https://openalex.org/W2348504720","https://openalex.org/W2332549523","https://openalex.org/W4352982540"],"abstract_inverted_index":{"In":[0],"most":[1],"of":[2,82],"the":[3,33,83],"shortest":[4,34,55],"path":[5,20,35,56],"problems":[6,10],"like":[7],"vehicle":[8],"routing":[9,13],"and":[11,24,26,49,88],"network":[12],"problems,":[14],"we":[15],"only":[16],"need":[17,92],"an":[18,51],"efficient":[19],"between":[21],"two":[22],"points---source":[23],"destination,":[25],"it":[27,89],"is":[28,85],"not":[29,91],"necessary":[30],"to":[31,38],"calculate":[32],"from":[36],"source":[37],"all":[39,70],"other":[40],"nodes.":[41],"This":[42],"paper":[43],"concentrates":[44],"on":[45],"this":[46],"very":[47],"idea":[48],"presents":[50],"algorithm":[52,63],"for":[53,57,69,96],"calculating":[54],"nonnegative":[58],"weighted":[59],"undirected":[60],"graphs.":[61],"The":[62,79],"completes":[64],"its":[65,86],"execution":[66],"in":[67],"O(|E|)":[68],"targeted":[71],"graphs---where":[72],"no":[73],"successor":[74],"node":[75],"updates":[76],"predecessor":[77],"node.":[78],"main":[80],"advantage":[81],"algorithms":[84],"simplicity":[87],"does":[90],"complex":[93],"data":[94],"structures":[95],"implementations.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}