{"id":"https://openalex.org/W2536112642","doi":"https://doi.org/10.1007/s00453-018-0452-3","title":"An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model","display_name":"An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model","publication_year":2018,"publication_date":"2018-05-21","ids":{"openalex":"https://openalex.org/W2536112642","doi":"https://doi.org/10.1007/s00453-018-0452-3","mag":"2536112642"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0452-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0452-3","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, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024739923","display_name":"Keerti Choudhary","orcid":"https://orcid.org/0000-0002-8289-5930"},"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":false,"raw_author_name":"Keerti Choudhary","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076616592","display_name":"Liam Roditty","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Liam Roditty","raw_affiliation_strings":["Department of Computer Science, Bar Ilan University, Ramat Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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":1.2798,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.81157236,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"81","issue":"3","first_page":"967","last_page":"985"},"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.9980000257492065,"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.9980000257492065,"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.9969000220298767,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962000250816345,"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/reachability","display_name":"Reachability","score":0.8577591776847839},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.6144425868988037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6115444302558899},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.5910835266113281},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5875458717346191},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5671625137329102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5473591685295105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5409361720085144},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5307528972625732},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5246477127075195},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4761248230934143},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4639676809310913},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.429049015045166},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40444013476371765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3553767502307892}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8577591776847839},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.6144425868988037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6115444302558899},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.5910835266113281},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5875458717346191},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5671625137329102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5473591685295105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5409361720085144},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5307528972625732},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5246477127075195},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4761248230934143},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4639676809310913},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.429049015045166},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40444013476371765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3553767502307892},{"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/s00453-018-0452-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0452-3","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W653534090","https://openalex.org/W1577501260","https://openalex.org/W1906469382","https://openalex.org/W1963633992","https://openalex.org/W1969916852","https://openalex.org/W1982876676","https://openalex.org/W1989169588","https://openalex.org/W2014881855","https://openalex.org/W2018804864","https://openalex.org/W2026486940","https://openalex.org/W2037034819","https://openalex.org/W2083795876","https://openalex.org/W2097490969","https://openalex.org/W2103027585","https://openalex.org/W2113600113","https://openalex.org/W2117909275","https://openalex.org/W2118382442","https://openalex.org/W2120724233","https://openalex.org/W2135290460","https://openalex.org/W2141257824","https://openalex.org/W2146507303","https://openalex.org/W2146522997","https://openalex.org/W2153715991","https://openalex.org/W2165150557","https://openalex.org/W2166444590","https://openalex.org/W2296109891","https://openalex.org/W2395489635","https://openalex.org/W2413699622","https://openalex.org/W2484480607","https://openalex.org/W2562376154","https://openalex.org/W2569680519","https://openalex.org/W2569880348","https://openalex.org/W2604904214","https://openalex.org/W2608864129","https://openalex.org/W2766824301","https://openalex.org/W2952837110","https://openalex.org/W2963694357","https://openalex.org/W2963927805","https://openalex.org/W3103270367","https://openalex.org/W3145128584","https://openalex.org/W4231289837","https://openalex.org/W4234397737","https://openalex.org/W4234410874","https://openalex.org/W4238411931","https://openalex.org/W4244131382","https://openalex.org/W4244278461","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2005300355","https://openalex.org/W4322767636","https://openalex.org/W2042010354","https://openalex.org/W2275744826","https://openalex.org/W2051201471","https://openalex.org/W2952383637","https://openalex.org/W2070510206","https://openalex.org/W30211255","https://openalex.org/W4297081602","https://openalex.org/W1697536320"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}