{"id":"https://openalex.org/W2972823486","doi":"https://doi.org/10.1109/eit.2019.8834298","title":"Parallelizing FluidC, a Community Finding Algorithm","display_name":"Parallelizing FluidC, a Community Finding Algorithm","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2972823486","doi":"https://doi.org/10.1109/eit.2019.8834298","mag":"2972823486"},"language":"en","primary_location":{"id":"doi:10.1109/eit.2019.8834298","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eit.2019.8834298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Electro Information Technology (EIT)","raw_type":"proceedings-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/A5108362474","display_name":"Christian Trefftz","orcid":null},"institutions":[{"id":"https://openalex.org/I8606887","display_name":"Grand Valley State University","ror":"https://ror.org/001m1hv61","country_code":"US","type":"education","lineage":["https://openalex.org/I8606887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christian Trefftz","raw_affiliation_strings":["School of Computing, Grand Valley State University, Allendale, Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Grand Valley State University, Allendale, Michigan","institution_ids":["https://openalex.org/I8606887"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061566483","display_name":"Ronald Rounsifer","orcid":null},"institutions":[{"id":"https://openalex.org/I8606887","display_name":"Grand Valley State University","ror":"https://ror.org/001m1hv61","country_code":"US","type":"education","lineage":["https://openalex.org/I8606887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald Rounsifer","raw_affiliation_strings":["School of Computing, Grand Valley State University, Allendale, Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Grand Valley State University, Allendale, Michigan","institution_ids":["https://openalex.org/I8606887"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070031860","display_name":"Jerry Scripps","orcid":"https://orcid.org/0000-0002-0155-254X"},"institutions":[{"id":"https://openalex.org/I8606887","display_name":"Grand Valley State University","ror":"https://ror.org/001m1hv61","country_code":"US","type":"education","lineage":["https://openalex.org/I8606887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry Scripps","raw_affiliation_strings":["School of Computing, Grand Valley State University, Allendale, Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Grand Valley State University, Allendale, Michigan","institution_ids":["https://openalex.org/I8606887"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1191246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":null,"first_page":"141","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9933000206947327,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9797000288963318,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9536150097846985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.69985032081604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6378705501556396},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5146582722663879},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.4917741119861603},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3593389093875885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3005908131599426},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12495645880699158},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12479358911514282}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9536150097846985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.69985032081604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6378705501556396},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5146582722663879},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.4917741119861603},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3593389093875885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3005908131599426},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12495645880699158},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12479358911514282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eit.2019.8834298","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eit.2019.8834298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Electro Information Technology (EIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1977713568","https://openalex.org/W1990600049","https://openalex.org/W2132202037","https://openalex.org/W2770480868","https://openalex.org/W3123255541","https://openalex.org/W4292081303","https://openalex.org/W6640570641"],"related_works":["https://openalex.org/W2077309407","https://openalex.org/W3088754131","https://openalex.org/W3038848193","https://openalex.org/W1725047827","https://openalex.org/W3166231268","https://openalex.org/W2966673134","https://openalex.org/W2953390393","https://openalex.org/W2184121962","https://openalex.org/W3201714511","https://openalex.org/W4301329442"],"abstract_inverted_index":{"FluidC":[0,40],"is":[1],"an":[2],"algorithm":[3,16,26,41],"to":[4,60],"find":[5],"communities":[6],"on":[7,30],"networks":[8],"(graphs).":[9],"Like":[10],"the":[11,15,25,39,50,61],"Label":[12],"Propagation":[13],"algorithm,":[14],"must":[17],"update":[18],"one":[19],"vertex":[20],"at":[21],"a":[22],"time.":[23],"Otherwise,":[24],"does":[27],"not":[28],"converge":[29],"bipartite":[31,34,53,56],"or":[32,54],"nearly":[33,55],"graphs.":[35],"We":[36],"have":[37],"parallelized":[38],"using":[42],"OpenMP":[43],"and":[44],"good":[45],"speedups":[46],"are":[47],"observed.":[48],"For":[49],"case":[51],"of":[52],"graphs,":[57],"we":[58],"revert":[59],"sequential":[62],"algorithm.":[63]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}