{"id":"https://openalex.org/W2084063516","doi":"https://doi.org/10.1016/0020-0190(94)90047-7","title":"On finding the strongly connected components in a directed graph","display_name":"On finding the strongly connected components in a directed graph","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2084063516","doi":"https://doi.org/10.1016/0020-0190(94)90047-7","mag":"2084063516"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)90047-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90047-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5001691319","display_name":"Esko Nuutila","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Esko Nuutila","raw_affiliation_strings":["Laboratory of Information Processing Science, Department of Computer Science, Helsinki University of Technology, Otakaari 1M, SF-02150 Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information Processing Science, Department of Computer Science, Helsinki University of Technology, Otakaari 1M, SF-02150 Espoo, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004458646","display_name":"Eljas Soisalon-Soininen","orcid":"https://orcid.org/0000-0001-6437-2127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eljas Soisalon-Soininen","raw_affiliation_strings":["Laboratory of Information Processing Science, Department of Computer Science, Helsinki University of Technology, Otakaari 1M, SF-02150 Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information Processing Science, Department of Computer Science, Helsinki University of Technology, Otakaari 1M, SF-02150 Espoo, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001691319"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.4897,"has_fulltext":false,"cited_by_count":163,"citation_normalized_percentile":{"value":0.65436893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"49","issue":"1","first_page":"9","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9890999794006348,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9850999712944031,"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/transitive-closure","display_name":"Transitive closure","score":0.7686105966567993},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.7342732548713684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48518115282058716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4774132966995239},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4735029339790344},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4521510601043701},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44390103220939636},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4363862872123718},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.43224969506263733},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4309084117412567},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4142061173915863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3594469428062439},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3582969307899475},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2445904016494751},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21270978450775146},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.10040983557701111},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.06557002663612366}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7686105966567993},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.7342732548713684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48518115282058716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4774132966995239},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4735029339790344},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4521510601043701},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44390103220939636},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4363862872123718},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43224969506263733},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4309084117412567},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4142061173915863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3594469428062439},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3582969307899475},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2445904016494751},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21270978450775146},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.10040983557701111},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.06557002663612366}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)90047-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90047-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.9019","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stg.cs.hut.fi/publications/nuutila-s-93.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W198808598","https://openalex.org/W1965253335","https://openalex.org/W2062626787","https://openalex.org/W2075410688","https://openalex.org/W2118382442","https://openalex.org/W2753176400","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W4253236276","https://openalex.org/W2032304805","https://openalex.org/W198808598","https://openalex.org/W3139713485","https://openalex.org/W1503149859","https://openalex.org/W2359423766","https://openalex.org/W2387223290","https://openalex.org/W4386005208","https://openalex.org/W4389913294","https://openalex.org/W2149020136"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}