{"id":"https://openalex.org/W2181839983","doi":"https://doi.org/10.1007/978-3-319-18173-8_3","title":"A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths","display_name":"A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2181839983","doi":"https://doi.org/10.1007/978-3-319-18173-8_3","mag":"2181839983"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-18173-8_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_3","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":"book-chapter","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/A5002493273","display_name":"Cristina Bazgan","orcid":"https://orcid.org/0000-0002-5460-6222"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cristina Bazgan","raw_affiliation_strings":["Institut Universitaire de France, Paris, France","PSL, Universit\u00e9 Paris-Dauphine, LAMSADE UMR CNRS, 7243, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Universitaire de France, Paris, France","institution_ids":["https://openalex.org/I185839726"]},{"raw_affiliation_string":"PSL, Universit\u00e9 Paris-Dauphine, LAMSADE UMR CNRS, 7243, Paris, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3274,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87980769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"60"},"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.9891999959945679,"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.9891999959945679,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9865999817848206,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9763000011444092,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7752306461334229},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6936134099960327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6876523494720459},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6442205309867859},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4762416183948517},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.47390472888946533},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.43039190769195557},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4024467170238495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3960579037666321},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35357487201690674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31554561853408813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26856884360313416}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7752306461334229},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6936134099960327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6876523494720459},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6442205309867859},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4762416183948517},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.47390472888946533},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.43039190769195557},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4024467170238495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3960579037666321},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35357487201690674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31554561853408813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26856884360313416},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-319-18173-8_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_3","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:CiteSeerX.psu:10.1.1.699.4224","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.4224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fpt.akt.tu-berlin.de/publications/vital_edges_shortest_path.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01431247v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01431247","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"9th International Conference - CIAC 2015, May 2015, Paris, France. pp.47-60, ⟨10.1007/978-3-319-18173-8_3⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/16145","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/16145","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"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/W9893930","https://openalex.org/W36639738","https://openalex.org/W127421644","https://openalex.org/W204341840","https://openalex.org/W1511638527","https://openalex.org/W1517036688","https://openalex.org/W1544421729","https://openalex.org/W1570425181","https://openalex.org/W1978228527","https://openalex.org/W1980943820","https://openalex.org/W2011039300","https://openalex.org/W2045966094","https://openalex.org/W2062808512","https://openalex.org/W2076631145","https://openalex.org/W2083748805","https://openalex.org/W2092574579","https://openalex.org/W2093517413","https://openalex.org/W2094463866","https://openalex.org/W2116087731","https://openalex.org/W2119218916","https://openalex.org/W2121815516","https://openalex.org/W2133494553","https://openalex.org/W2137012936","https://openalex.org/W2139610344","https://openalex.org/W2241275978","https://openalex.org/W2570525280","https://openalex.org/W2953256896","https://openalex.org/W4245095675","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W94062305","https://openalex.org/W4287775348","https://openalex.org/W2237480599","https://openalex.org/W4388031360","https://openalex.org/W2018146256","https://openalex.org/W2361081252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}