{"id":"https://openalex.org/W1969573308","doi":"https://doi.org/10.1016/s0304-3975(03)00402-x","title":"A new approach to all-pairs shortest paths on real-weighted graphs","display_name":"A new approach to all-pairs shortest paths on real-weighted graphs","publication_year":2003,"publication_date":"2003-08-08","ids":{"openalex":"https://openalex.org/W1969573308","doi":"https://doi.org/10.1016/s0304-3975(03)00402-x","mag":"1969573308"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(03)00402-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00402-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, USA","Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":7.2736,"has_fulltext":false,"cited_by_count":206,"citation_normalized_percentile":{"value":0.97438361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"312","issue":"1","first_page":"47","last_page":"74"},"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.9983999729156494,"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.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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/T11106","display_name":"Data Management and Algorithms","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6696979999542236},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.659698486328125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6372538805007935},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5966553092002869},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5655761957168579},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.5490021705627441},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5029088854789734},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.49632054567337036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4551827609539032},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4539702534675598},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4400779604911804},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15201282501220703}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6696979999542236},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.659698486328125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6372538805007935},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5966553092002869},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5655761957168579},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.5490021705627441},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5029088854789734},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.49632054567337036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4551827609539032},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4539702534675598},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4400779604911804},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15201282501220703}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0304-3975(03)00402-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00402-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.6130","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/seth/papers/tcs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.1574","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~pettie/papers/tcs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.696.5042","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.5042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/%7Epettie/papers/tcs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319077","display_name":"Society for the Study of School Psychology","ror":"https://ror.org/00gz9xf10"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1480135873","https://openalex.org/W1567047166","https://openalex.org/W1582106056","https://openalex.org/W1598589216","https://openalex.org/W1602103078","https://openalex.org/W1823654214","https://openalex.org/W1965525854","https://openalex.org/W1969357318","https://openalex.org/W1969668378","https://openalex.org/W1978715699","https://openalex.org/W1986261983","https://openalex.org/W1990678352","https://openalex.org/W1999545213","https://openalex.org/W2022980325","https://openalex.org/W2028341270","https://openalex.org/W2029132631","https://openalex.org/W2032841680","https://openalex.org/W2048824634","https://openalex.org/W2049500052","https://openalex.org/W2049774319","https://openalex.org/W2058426370","https://openalex.org/W2059598403","https://openalex.org/W2060919812","https://openalex.org/W2071845176","https://openalex.org/W2084224084","https://openalex.org/W2090747326","https://openalex.org/W2095206322","https://openalex.org/W2105310556","https://openalex.org/W2109315180","https://openalex.org/W2115873073","https://openalex.org/W2124852572","https://openalex.org/W2133768189","https://openalex.org/W2150567347","https://openalex.org/W2151021662","https://openalex.org/W2160365857","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2618199688","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4249266610","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2030169809","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2305559042","https://openalex.org/W2183791707","https://openalex.org/W2002764510","https://openalex.org/W2741557789"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}