{"id":"https://openalex.org/W1600381863","doi":"https://doi.org/10.1007/3-540-60313-1_132","title":"Optimal parallel shortest paths in small treewidth digraphs","display_name":"Optimal parallel shortest paths in small treewidth digraphs","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1600381863","doi":"https://doi.org/10.1007/3-540-60313-1_132","mag":"1600381863"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60313-1_132","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60313-1_132","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"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":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","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":false,"raw_author_name":"Christos D. Zaroliagis","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"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":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1067,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7638484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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.9977999925613403,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9976999759674072,"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/treewidth","display_name":"Treewidth","score":0.8512325286865234},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7374697923660278},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.7347301840782166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5925167202949524},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5361878871917725},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5296717882156372},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4742904305458069},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46255651116371155},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45240527391433716},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.40946221351623535},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.36783647537231445},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3639501929283142},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31597548723220825},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2880339026451111},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09511327743530273}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8512325286865234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7374697923660278},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.7347301840782166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5925167202949524},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5361878871917725},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5296717882156372},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4742904305458069},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46255651116371155},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45240527391433716},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.40946221351623535},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.36783647537231445},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3639501929283142},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31597548723220825},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2880339026451111},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09511327743530273},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-60313-1_132","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60313-1_132","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:edoc.mpg.de:517823","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517823","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":"Spirakis, Paul: Algorithms - ESA'95: 3rd Annual European Symposium, Springer, 31-45 (1995)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1331859","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-ACAF-C","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":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1600381863","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1331859","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"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/W1513400187","https://openalex.org/W1541012495","https://openalex.org/W1595621389","https://openalex.org/W1602042964","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/W2067533448","https://openalex.org/W2075188242","https://openalex.org/W2135674162","https://openalex.org/W4399554296","https://openalex.org/W6637190722","https://openalex.org/W6683227944","https://openalex.org/W6703734804"],"related_works":["https://openalex.org/W2916553772","https://openalex.org/W3014758179","https://openalex.org/W2138841062","https://openalex.org/W64951736","https://openalex.org/W1602978248","https://openalex.org/W2926426864","https://openalex.org/W2950313362","https://openalex.org/W2485865435","https://openalex.org/W786724073","https://openalex.org/W2067533448","https://openalex.org/W2163768829","https://openalex.org/W2952240781","https://openalex.org/W3000986974","https://openalex.org/W10405664","https://openalex.org/W2172690851","https://openalex.org/W3090320510","https://openalex.org/W3127920245","https://openalex.org/W2970277130","https://openalex.org/W2143561549","https://openalex.org/W2085201606"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}