{"id":"https://openalex.org/W2048362350","doi":"https://doi.org/10.1016/s0304-3975(98)00021-8","title":"Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms","display_name":"Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms","publication_year":1998,"publication_date":"1998-08-01","ids":{"openalex":"https://openalex.org/W2048362350","doi":"https://doi.org/10.1016/s0304-3975(98)00021-8","mag":"2048362350"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00021-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00021-8","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/A5109880876","display_name":"Shiva Chaudhuri","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Shiva Chaudhuri","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany","Max-Planck Institut F\u00fcr Informatik, Saabr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saabr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christos D. Zaroliagis","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany","Max-Planck Institut F\u00fcr Informatik, Saabr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saabr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014917579"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.5085,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.65976512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"203","issue":"2","first_page":"205","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9962999820709229,"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/treewidth","display_name":"Treewidth","score":0.8590548634529114},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7090759873390198},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.6939693689346313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5784300565719604},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5078485608100891},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48174217343330383},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45535707473754883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45024561882019043},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4259141683578491},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4178736209869385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39875781536102295},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.36677026748657227},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3411688804626465},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3253319263458252},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3139275312423706},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08360099792480469}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8590548634529114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7090759873390198},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6939693689346313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5784300565719604},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5078485608100891},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48174217343330383},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45535707473754883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45024561882019043},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4259141683578491},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4178736209869385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39875781536102295},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.36677026748657227},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3411688804626465},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3253319263458252},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3139275312423706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08360099792480469},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1016/s0304-3975(98)00021-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00021-8","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.34.7489","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.7489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.mpi-sb.mpg.de/pub/papers/reports/MPI-I-95-1-021.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.409","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.409","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/~shiva/publications/sp-par.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.2582","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.2582","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/~zaro/publications/Zaro-SP-II.ps.gz","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:517688","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517688","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, v.203, 205-223 (1998)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1331374","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-37E3-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1485089533","https://openalex.org/W1541012495","https://openalex.org/W1595621389","https://openalex.org/W1836127928","https://openalex.org/W1859866712","https://openalex.org/W1997039683","https://openalex.org/W2029448190","https://openalex.org/W2033405938","https://openalex.org/W2034501206","https://openalex.org/W2046946959","https://openalex.org/W2067533448","https://openalex.org/W2075188242","https://openalex.org/W2120490947","https://openalex.org/W2135674162","https://openalex.org/W2159003936","https://openalex.org/W2338905098","https://openalex.org/W2986773320","https://openalex.org/W3004680345","https://openalex.org/W4399554296","https://openalex.org/W6629073861","https://openalex.org/W6631068759","https://openalex.org/W6631969875","https://openalex.org/W6632302264","https://openalex.org/W6635798072","https://openalex.org/W6649693998","https://openalex.org/W6657172874","https://openalex.org/W6679865377","https://openalex.org/W6683227944","https://openalex.org/W6869340774"],"related_works":["https://openalex.org/W2091382007","https://openalex.org/W1539278744","https://openalex.org/W1485639265","https://openalex.org/W2111290740","https://openalex.org/W2143406303","https://openalex.org/W4309067788","https://openalex.org/W2223243427","https://openalex.org/W2803227791","https://openalex.org/W143512583","https://openalex.org/W4385772980"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}