{"id":"https://openalex.org/W2093899598","doi":"https://doi.org/10.1007/bf01190847","title":"All-pairs shortest paths and the essential subgraph","display_name":"All-pairs shortest paths and the essential subgraph","publication_year":1995,"publication_date":"1995-05-01","ids":{"openalex":"https://openalex.org/W2093899598","doi":"https://doi.org/10.1007/bf01190847","mag":"2093899598"},"language":"en","primary_location":{"id":"doi:10.1007/bf01190847","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01190847","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5077539630","display_name":"Catherine C. McGeoch","orcid":"https://orcid.org/0000-0002-4023-0551"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. C. McGeoch","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amherst College, 01002, Amherst, MA, USA","Department of Mathematics and Computer Science, Amherst College, Amherst, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amherst College, 01002, Amherst, MA, USA","institution_ids":["https://openalex.org/I177605424"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amherst College, Amherst, USA","institution_ids":["https://openalex.org/I177605424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077539630"],"corresponding_institution_ids":["https://openalex.org/I177605424"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0741,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.78010268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"5","first_page":"426","last_page":"441"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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/combinatorics","display_name":"Combinatorics","score":0.8195137977600098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7468538284301758},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6435238122940063},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.622860848903656},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5586313009262085},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5522477626800537},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5064088106155396},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4721790850162506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4699525833129883},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45607641339302063},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.42874160408973694},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4264470934867859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16730567812919617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1547028124332428},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14880672097206116},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06423279643058777}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8195137977600098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7468538284301758},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6435238122940063},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.622860848903656},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5586313009262085},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5522477626800537},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5064088106155396},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4721790850162506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4699525833129883},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45607641339302063},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.42874160408973694},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4264470934867859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16730567812919617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1547028124332428},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14880672097206116},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06423279643058777},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01190847","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01190847","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1989111470","https://openalex.org/W1997914438","https://openalex.org/W1998167497","https://openalex.org/W2007572995","https://openalex.org/W2012456804","https://openalex.org/W2022980325","https://openalex.org/W2027580688","https://openalex.org/W2028341270","https://openalex.org/W2033661926","https://openalex.org/W2051213257","https://openalex.org/W2054523876","https://openalex.org/W2054812794","https://openalex.org/W2059014957","https://openalex.org/W2084224084","https://openalex.org/W2084623271","https://openalex.org/W2133768189","https://openalex.org/W2160365857","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2618199688","https://openalex.org/W2905110430","https://openalex.org/W4247674447","https://openalex.org/W4312512934","https://openalex.org/W6737864365"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2940255547","https://openalex.org/W2906832313","https://openalex.org/W1544045550"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2025-10-10T00:00:00"}