{"id":"https://openalex.org/W4229024662","doi":"https://doi.org/10.1145/3528416.3530247","title":"Efficient trimming for strongly connected components calculation","display_name":"Efficient trimming for strongly connected components calculation","publication_year":2022,"publication_date":"2022-05-05","ids":{"openalex":"https://openalex.org/W4229024662","doi":"https://doi.org/10.1145/3528416.3530247"},"language":"en","primary_location":{"id":"doi:10.1145/3528416.3530247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3528416.3530247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/804e3c5a-8092-4019-b818-883ef4cbff74","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5096227400","display_name":"Dante Niewenhuis","orcid":"https://orcid.org/0000-0002-9114-1364"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Dante Niewenhuis","raw_affiliation_strings":["University of Amsterdam, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087297053","display_name":"Ana-Lucia Varbanescu","orcid":"https://orcid.org/0000-0002-4932-1900"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ana-Lucia Varbanescu","raw_affiliation_strings":["University of Amsterdam, Amsterdam, University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5096227400"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":0.2503,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49231721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/trimming","display_name":"Trimming","score":0.964321494102478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7859051823616028},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6841620206832886},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5770696997642517},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5562872886657715},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5561596751213074},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4987211227416992},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4832666516304016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36414003372192383},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12371733784675598},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07929784059524536}],"concepts":[{"id":"https://openalex.org/C56951928","wikidata":"https://www.wikidata.org/wiki/Q3539213","display_name":"Trimming","level":2,"score":0.964321494102478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7859051823616028},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6841620206832886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5770696997642517},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5562872886657715},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5561596751213074},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4987211227416992},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4832666516304016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36414003372192383},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12371733784675598},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07929784059524536},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3528416.3530247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3528416.3530247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/804e3c5a-8092-4019-b818-883ef4cbff74","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/804e3c5a-8092-4019-b818-883ef4cbff74","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Niewenhuis, D & Varbanescu, A L 2022, Efficient trimming for strongly connected components calculation. in Proceedings of the 19th ACM International Conference on Computing Frontiers 2022, CF 2022. Association for Computing Machinery, pp. 131-140, 19th ACM International Conference on Computing Frontiers, CF 2022, Turin, Italy, 17/05/22. https://doi.org/10.1145/3528416.3530247","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/804e3c5a-8092-4019-b818-883ef4cbff74","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/804e3c5a-8092-4019-b818-883ef4cbff74","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Niewenhuis, D & Varbanescu, A L 2022, Efficient trimming for strongly connected components calculation. in Proceedings of the 19th ACM International Conference on Computing Frontiers 2022, CF 2022. Association for Computing Machinery, pp. 131-140, 19th ACM International Conference on Computing Frontiers, CF 2022, Turin, Italy, 17/05/22. https://doi.org/10.1145/3528416.3530247","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1984914680","https://openalex.org/W1986678763","https://openalex.org/W2011329918","https://openalex.org/W2042010354","https://openalex.org/W2046526098","https://openalex.org/W2047345171","https://openalex.org/W2082801772","https://openalex.org/W2097884397","https://openalex.org/W2099624270","https://openalex.org/W2113667851","https://openalex.org/W2148755014","https://openalex.org/W2310059131","https://openalex.org/W2323352721","https://openalex.org/W2792353048","https://openalex.org/W2902879940","https://openalex.org/W4210896998"],"related_works":["https://openalex.org/W2467235537","https://openalex.org/W4243755427","https://openalex.org/W1493074871","https://openalex.org/W2222099502","https://openalex.org/W2128287377","https://openalex.org/W1979067309","https://openalex.org/W2375590729","https://openalex.org/W2385024427","https://openalex.org/W2978797270","https://openalex.org/W2069614077"],"abstract_inverted_index":{"Strongly":[0],"Connected":[1],"Components":[2],"(SCCs)":[3],"are":[4],"useful":[5],"for":[6],"many":[7],"applications,":[8],"such":[9],"as":[10],"community":[11],"detection":[12],"and":[13,27,40],"personalized":[14],"recommendation.":[15],"Determining":[16],"the":[17,35,47],"SCCs":[18,59],"of":[19,61],"a":[20,62],"graph,":[21],"however,":[22],"can":[23],"be":[24],"very":[25],"expensive,":[26],"parallelization":[28],"is":[29,38,53,72,81],"not":[30],"an":[31,73],"easy":[32],"way":[33],"out:":[34],"paral-lelization":[36],"itself":[37],"challenging,":[39],"its":[41],"performance":[42],"impact":[43],"varies":[44],"non-trivially":[45],"with":[46,87],"input":[48],"graph":[49],"structure.":[50],"This":[51],"variability":[52],"due":[54],"to":[55,67,76],"trivial":[56,78,89],"components,":[57,79],"i.e.,":[58],"consisting":[60],"single":[63],"vertex,":[64],"which":[65],"lead":[66],"significant":[68],"workload":[69],"imbalance.":[70],"Trimming":[71],"effective":[74],"method":[75],"remove":[77],"but":[80],"inefficient":[82],"when":[83],"used":[84],"on":[85],"graphs":[86],"few":[88],"components.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-01T08:36:08.643496","created_date":"2025-10-10T00:00:00"}