{"id":"https://openalex.org/W2057925324","doi":"https://doi.org/10.1109/bigdata.2014.7004366","title":"ParK: An efficient algorithm for k-core decomposition on multicore processors","display_name":"ParK: An efficient algorithm for k-core decomposition on multicore processors","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2057925324","doi":"https://doi.org/10.1109/bigdata.2014.7004366","mag":"2057925324"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2014.7004366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","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/A5080958116","display_name":"Naga Shailaja Dasari","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Naga Shailaja Dasari","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102707396","display_name":"Desh Ranjan","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ranjan Desh","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101789500","display_name":"Mohammad Zubair","orcid":"https://orcid.org/0000-0002-5449-1779"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Zubair","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, USA","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5989,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.9348634,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9925000071525574,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9925000071525574,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9907000064849854,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9765999913215637,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.7682356834411621},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.695338249206543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6422260403633118},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.533513069152832},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4307180643081665},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42411312460899353},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4105813503265381},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39742881059646606},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3647956848144531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2742346525192261}],"concepts":[{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.7682356834411621},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.695338249206543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6422260403633118},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.533513069152832},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4307180643081665},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42411312460899353},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4105813503265381},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39742881059646606},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3647956848144531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2742346525192261},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2014.7004366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","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":35,"referenced_works":["https://openalex.org/W229097380","https://openalex.org/W950821216","https://openalex.org/W1494411790","https://openalex.org/W1499240152","https://openalex.org/W1566772816","https://openalex.org/W1567562836","https://openalex.org/W1570371166","https://openalex.org/W1635909395","https://openalex.org/W1780855506","https://openalex.org/W1889000954","https://openalex.org/W1971717360","https://openalex.org/W2021685712","https://openalex.org/W2040411864","https://openalex.org/W2055497547","https://openalex.org/W2071864549","https://openalex.org/W2084668738","https://openalex.org/W2087290812","https://openalex.org/W2087421046","https://openalex.org/W2118136127","https://openalex.org/W2124480634","https://openalex.org/W2133131640","https://openalex.org/W2148606255","https://openalex.org/W2162808198","https://openalex.org/W2169253214","https://openalex.org/W2950030182","https://openalex.org/W2951113132","https://openalex.org/W2963054764","https://openalex.org/W6608852248","https://openalex.org/W6630004417","https://openalex.org/W6634020178","https://openalex.org/W6637961081","https://openalex.org/W6639704088","https://openalex.org/W6639805184","https://openalex.org/W6684712364","https://openalex.org/W6891968066"],"related_works":["https://openalex.org/W1542410906","https://openalex.org/W197049984","https://openalex.org/W1993191611","https://openalex.org/W2023938924","https://openalex.org/W2918840249","https://openalex.org/W1991859582","https://openalex.org/W2110053126","https://openalex.org/W2316512426","https://openalex.org/W2104702637","https://openalex.org/W2079303253"],"abstract_inverted_index":{"The":[0,14,58,75],"k-core":[1,15,43,90,113],"of":[2,23,34,69,104,134,161,164,191],"a":[3,27,41,170,227,247],"graph":[4,56],"is":[5,17,30,66,84,95,108,137,143,218,235],"the":[6,20,31,37,67,86,93,102,119,130,135,140,162,177,183,192,208,233,261],"largest":[7,32],"induced":[8],"subgraph":[9],"with":[10,196,211],"minimum":[11],"degree":[12],"k.":[13],"decomposition":[16,44,114],"to":[18,40,101,198,220,237,265],"find":[19],"core":[21],"number":[22],"each":[24],"vertex":[25,38],"in":[26,47],"graph,":[28],"which":[29,252],"value":[33],"k":[35],"that":[36,174,216,232,260],"belongs":[39],"k-core.":[42],"has":[45,121,253],"applications":[46],"many":[48],"areas":[49],"including":[50],"network":[51],"analysis,":[52],"computational":[53],"biology":[54],"and":[55,81,83,100,139,166,168,181,202,214,230,258],"visualization.":[57],"primary":[59],"reason":[60],"for":[61,89,98,112,126,150],"it":[62,146,217],"being":[63],"widely":[64],"used":[65],"availability":[68],"an":[70,158,188],"O(n":[71],"+":[72],"m)":[73],"algorithm.":[74],"algorithm":[76,88,94,110,120,136,163,193,210,213,234,262],"was":[77],"proposed":[78,111],"by":[79],"Batagelj":[80,165],"Zaversnik":[82,167],"considered":[85],"state-of-the-art":[87,212],"decomposition.":[91],"However,":[92],"not":[96,122],"suitable":[97],"parallelization":[99,238],"best":[103],"our":[105,244],"knowledge":[106],"there":[107],"no":[109],"on":[115,239,246],"multicore":[116,240],"processors.":[117],"Also,":[118],"been":[123],"experimentally":[124],"analyzed":[125],"large":[127,151],"graphs.":[128,152],"Since":[129],"working":[131,178],"set":[132,179],"size":[133,180],"large,":[138],"access":[141],"pattern":[142],"highly":[144],"random,":[145],"can":[147],"be":[148],"inefficient":[149],"In":[153],"this":[154],"paper,":[155],"we":[156],"present":[157],"experimental":[159,189],"analysis":[160,190],"propose":[169],"new":[171],"algorithm,":[172],"ParK,":[173],"significantly":[175],"reduces":[176],"minimizes":[182],"random":[184],"accesses.":[185],"We":[186,206,224,242],"provide":[187,226],"using":[194,268],"graphs":[195],"up":[197,219,264],"65":[199],"million":[200],"vertices":[201],"1.8":[203],"billion":[204],"edges.":[205],"compare":[207],"ParK":[209],"show":[215,231,259],"6":[221],"times":[222,267],"faster.":[223],"also":[225],"parallel":[228],"methodology":[229],"amenable":[236],"architectures.":[241],"ran":[243],"experiments":[245],"4":[248],"socket":[249,257],"Nehalem-EX":[250],"processor":[251],"8":[254],"cores":[255],"per":[256],"scales":[263],"21":[266],"32":[269],"cores.":[270]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}