{"id":"https://openalex.org/W2132602186","doi":"https://doi.org/10.2478/s13537-013-0110-4","title":"An all-pairs shortest path algorithm for bipartite graphs","display_name":"An all-pairs shortest path algorithm for bipartite graphs","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2132602186","doi":"https://doi.org/10.2478/s13537-013-0110-4","mag":"2132602186"},"language":"en","primary_location":{"id":"doi:10.2478/s13537-013-0110-4","is_oa":true,"landing_page_url":"https://doi.org/10.2478/s13537-013-0110-4","pdf_url":"https://www.degruyter.com/document/doi/10.2478/s13537-013-0110-4/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.degruyter.com/document/doi/10.2478/s13537-013-0110-4/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016296990","display_name":"Svetlana Torgasin","orcid":null},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Svetlana Torgasin","raw_affiliation_strings":["Hamburg University of Technology, 21071, Hamburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hamburg University of Technology, 21071, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113941194","display_name":"Karl-Heinz Zimmermann","orcid":null},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl-Heinz Zimmermann","raw_affiliation_strings":["Hamburg University of Technology, 21071, Hamburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hamburg University of Technology, 21071, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016296990"],"corresponding_institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"],"apc_list":{"value":1000,"currency":"EUR","value_usd":1078},"apc_paid":{"value":1000,"currency":"EUR","value_usd":1078},"fwci":0.544,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72295747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"4","first_page":"149","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9976000189781189,"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/bipartite-graph","display_name":"Bipartite graph","score":0.853188693523407},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7797616720199585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5194125175476074},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5086055994033813},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.505167543888092},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4918515682220459},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4861571490764618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4710996747016907},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.45515912771224976},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41488102078437805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3761018216609955},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3474975526332855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34205323457717896}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.853188693523407},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7797616720199585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5194125175476074},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5086055994033813},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.505167543888092},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4918515682220459},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4861571490764618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4710996747016907},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.45515912771224976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41488102078437805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3761018216609955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3474975526332855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34205323457717896},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2478/s13537-013-0110-4","is_oa":true,"landing_page_url":"https://doi.org/10.2478/s13537-013-0110-4","pdf_url":"https://www.degruyter.com/document/doi/10.2478/s13537-013-0110-4/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c19aaea3280f440f96772622557303bf","is_oa":true,"landing_page_url":"https://doaj.org/article/c19aaea3280f440f96772622557303bf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Open Computer Science, Vol 3, Iss 4, Pp 149-157 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2478/s13537-013-0110-4","is_oa":true,"landing_page_url":"https://doi.org/10.2478/s13537-013-0110-4","pdf_url":"https://www.degruyter.com/document/doi/10.2478/s13537-013-0110-4/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2132602186.pdf","grobid_xml":"https://content.openalex.org/works/W2132602186.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W146866247","https://openalex.org/W1504291959","https://openalex.org/W1527132663","https://openalex.org/W1535408272","https://openalex.org/W1973119168","https://openalex.org/W1979740015","https://openalex.org/W1979867994","https://openalex.org/W2006570180","https://openalex.org/W2007572995","https://openalex.org/W2021227709","https://openalex.org/W2022980325","https://openalex.org/W2028341270","https://openalex.org/W2035476608","https://openalex.org/W2104734478","https://openalex.org/W2109370679","https://openalex.org/W2135039026","https://openalex.org/W2156047991"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2030169809","https://openalex.org/W2002764510","https://openalex.org/W2741557789","https://openalex.org/W2305559042","https://openalex.org/W3121758909","https://openalex.org/W2802855710"],"abstract_inverted_index":{"Abstract":[0],"Bipartite":[1],"graphs":[2],"are":[3],"widely":[4],"used":[5],"for":[6,19,44],"modeling":[7],"of":[8,38,74,87],"complex":[9],"structures":[10,24],"in":[11,22],"biology,":[12],"engineering,":[13],"and":[14,56,78],"computer":[15],"science.":[16],"The":[17,47,66],"search":[18],"shortest":[20,41],"paths":[21],"such":[23],"is":[25,49,69],"a":[26,36,72],"highly":[27],"demanded":[28],"procedure":[29],"that":[30],"requires":[31],"optimization.":[32],"This":[33],"paper":[34],"presents":[35],"variant":[37],"the":[39,52,58,63,79,92],"all-pairs":[40],"path":[42],"algorithm":[43,60],"bipartite":[45],"graphs.":[46],"method":[48],"based":[50],"on":[51],"distance":[53],"matrix":[54],"product":[55],"improves":[57],"general":[59],"by":[61,71,83],"exploiting":[62],"graph":[64],"topology.":[65],"space":[67],"complexity":[68,81],"reduced":[70],"factor":[73],"at":[75],"least":[76],"four":[77],"time":[80],"decreased":[82],"almost":[84],"an":[85],"order":[86],"magnitude":[88],"when":[89],"compared":[90],"with":[91],"basic":[93],"APSP":[94],"algorithm.":[95]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}