{"id":"https://openalex.org/W2125528794","doi":"https://doi.org/10.25596/jalc-2002-321","title":"Semiring Frameworks and Algorithms for Shortest-Distance Problems","display_name":"Semiring Frameworks and Algorithms for Shortest-Distance Problems","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2125528794","doi":"https://doi.org/10.25596/jalc-2002-321","mag":"2125528794"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.5405","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.5405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~lhuang3/wpe2/papers/mohri02semiring.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.25596/jalc-2002-321","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058849006","display_name":"Mehryar Mohri","orcid":"https://orcid.org/0000-0002-3987-9847"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohri, Mehryar","raw_affiliation_strings":["AT&T Labs - Research, 180 Park Avenue, Rm E135, Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs - Research, 180 Park Avenue, Rm E135, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058849006"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":10.7249,"has_fulltext":false,"cited_by_count":256,"citation_normalized_percentile":{"value":0.98913374,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973999857902527,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/semiring","display_name":"Semiring","score":0.8760451078414917},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6430997252464294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5467251539230347},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5210839509963989},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5192177891731262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4807986319065094},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.47213631868362427},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4632265567779541},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45443931221961975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44734546542167664},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36562302708625793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34233981370925903},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.25658905506134033}],"concepts":[{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.8760451078414917},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6430997252464294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5467251539230347},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5210839509963989},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5192177891731262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4807986319065094},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.47213631868362427},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4632265567779541},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45443931221961975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44734546542167664},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36562302708625793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34233981370925903},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.25658905506134033},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.5405","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.5405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~lhuang3/wpe2/papers/mohri02semiring.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.5273","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mohri/postscript/jalc.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.5897","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.5897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nyu.edu/~mohri/pub/jalc.pdf","raw_type":"text"},{"id":"doi:10.25596/jalc-2002-321","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-321","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-321","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-321","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W36566811","https://openalex.org/W51323104","https://openalex.org/W53596869","https://openalex.org/W88449698","https://openalex.org/W200927961","https://openalex.org/W1505482284","https://openalex.org/W1506437980","https://openalex.org/W1541016733","https://openalex.org/W1557235141","https://openalex.org/W1570445666","https://openalex.org/W1578332044","https://openalex.org/W1655990431","https://openalex.org/W1964119857","https://openalex.org/W1993449345","https://openalex.org/W2002531683","https://openalex.org/W2007572995","https://openalex.org/W2010194128","https://openalex.org/W2013714680","https://openalex.org/W2014211132","https://openalex.org/W2039829163","https://openalex.org/W2060072995","https://openalex.org/W2061736301","https://openalex.org/W2076171427","https://openalex.org/W2087382212","https://openalex.org/W2089957823","https://openalex.org/W2104734478","https://openalex.org/W2118382442","https://openalex.org/W2125529971","https://openalex.org/W2125690626","https://openalex.org/W2131058166","https://openalex.org/W2169528473","https://openalex.org/W2171697943","https://openalex.org/W2227557434","https://openalex.org/W2317198545","https://openalex.org/W2331292038","https://openalex.org/W2484714406","https://openalex.org/W2624992833","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W3139578191"],"related_works":["https://openalex.org/W2169528473","https://openalex.org/W1607161872","https://openalex.org/W2125529971","https://openalex.org/W1582482241","https://openalex.org/W2752885492","https://openalex.org/W1860547055","https://openalex.org/W2087382212","https://openalex.org/W1578332044","https://openalex.org/W2049633694","https://openalex.org/W2227557434","https://openalex.org/W2143658255","https://openalex.org/W2046932483","https://openalex.org/W2039829163","https://openalex.org/W2009570821","https://openalex.org/W1647671624","https://openalex.org/W1629199664","https://openalex.org/W36566811","https://openalex.org/W1655990431","https://openalex.org/W1625762979","https://openalex.org/W1506437980"],"abstract_inverted_index":{"We":[0,14,80],"define":[1],"general":[2,37],"algebraic":[3],"frameworks":[4],"for":[5,19],"shortest-distance":[6,70],"problems":[7,52,71],"based":[8],"on":[9],"the":[10,30,33,56,108],"structure":[11],"??":[12],"semirings.":[13],"give":[15],"a":[16,25,60,121],"generic":[17,91],"algorithm":[18,42],"finding":[20],"single-source":[21,69],"shortest":[22,50],"distances":[23,58],"in":[24,59,72,115],"weighted":[26,73],"directed":[27,61,74],"graph":[28],"when":[29],"weights":[31],"satisfy":[32],"conditions":[34],"of":[35,89,107,110,124],"our":[36,90],"semiring":[38],"framework.":[39],"The":[40,105],"same":[41],"can":[43,64],"be":[44,65],"used":[45,66],"to":[46,54,67,93],"solve":[47,68],"efficiently":[48],"classical":[49],"paths":[51],"or":[53],"find":[55],"k-shortest":[57],"graph.":[62],"It":[63],"acyclic":[75],"graphs":[76],"over":[77],"any":[78],"semiring.":[79],"examine":[81],"several":[82],"semirings":[83],"and":[84,97,103,120],"describe":[85],"some":[86],"specific":[87],"instances":[88],"algorithms":[92,112],"illustrate":[94],"their":[95,118,125],"use":[96],"compare":[98],"them":[99],"with":[100],"existing":[101],"methods":[102],"algorithms.":[104],"proof":[106],"soundness":[109],"all":[111],"is":[113],"given":[114],"detail,":[116],"including":[117],"pseudocode":[119],"full":[122],"analysis":[123],"running":[126],"time":[127],"complexity.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}