{"id":"https://openalex.org/W2083795876","doi":"https://doi.org/10.1007/s00453-012-9621-y","title":"Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs","display_name":"Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs","publication_year":2012,"publication_date":"2012-02-22","ids":{"openalex":"https://openalex.org/W2083795876","doi":"https://doi.org/10.1007/s00453-012-9621-y","mag":"2083795876"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9621-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9621-y","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/A5059835930","display_name":"Surender Baswana","orcid":"https://orcid.org/0000-0001-8657-7182"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Surender Baswana","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Kanpur, Kanpur, 208016, India","[IIT, Kanpur]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Kanpur, Kanpur, 208016, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"[IIT, Kanpur]","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009672596","display_name":"Neelesh Khanna","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165642","display_name":"Oracle (India)","ror":"https://ror.org/05dd0pt55","country_code":"IN","type":"company","lineage":["https://openalex.org/I1342911587","https://openalex.org/I4210165642"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Neelesh Khanna","raw_affiliation_strings":["Oracle India Pvt. Ltd., Bangalore, 560029, India","Oracle India Pvt Ltd"],"affiliations":[{"raw_affiliation_string":"Oracle India Pvt. Ltd., Bangalore, 560029, India","institution_ids":["https://openalex.org/I4210165642"]},{"raw_affiliation_string":"Oracle India Pvt Ltd","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059835930"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.4188,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.8921896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"66","issue":"1","first_page":"18","last_page":"50"},"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.9997000098228455,"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.9997000098228455,"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.9987000226974487,"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.9973999857902527,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7657820582389832},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7233299016952515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.716512143611908},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6234484910964966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5865198373794556},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5858933925628662},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5509544610977173},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4986753463745117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43100664019584656},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41872987151145935},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39187970757484436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2865528166294098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2715153098106384}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7657820582389832},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7233299016952515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.716512143611908},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6234484910964966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5865198373794556},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5858933925628662},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5509544610977173},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4986753463745117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43100664019584656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41872987151145935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39187970757484436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2865528166294098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2715153098106384},{"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.1007/s00453-012-9621-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9621-y","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.53","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.53","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitk.ac.in/users/sbaswana/Papers-published/Algorithmica-Khanna.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1577501260","https://openalex.org/W1582742149","https://openalex.org/W1773616669","https://openalex.org/W1980943820","https://openalex.org/W1982440947","https://openalex.org/W1984407615","https://openalex.org/W1988067232","https://openalex.org/W1989169588","https://openalex.org/W1998002108","https://openalex.org/W1999667176","https://openalex.org/W2011282943","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2037489203","https://openalex.org/W2045446569","https://openalex.org/W2075543862","https://openalex.org/W2076163262","https://openalex.org/W2083534148","https://openalex.org/W2084224084","https://openalex.org/W2117909275","https://openalex.org/W2133768189","https://openalex.org/W2134729426","https://openalex.org/W2156047991","https://openalex.org/W2157760787","https://openalex.org/W2588591072","https://openalex.org/W2766824301","https://openalex.org/W2911502905","https://openalex.org/W4238714119","https://openalex.org/W4244278461","https://openalex.org/W4245095675"],"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":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}