{"id":"https://openalex.org/W2902344770","doi":"https://doi.org/10.1109/hpec.2018.8547523","title":"Fast Stochastic Block Partition for Streaming Graphs","display_name":"Fast Stochastic Block Partition for Streaming Graphs","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2902344770","doi":"https://doi.org/10.1109/hpec.2018.8547523","mag":"2902344770"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2018.8547523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5022107746","display_name":"Ahsen J. Uppal","orcid":null},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahsen J. Uppal","raw_affiliation_strings":["The George Washington University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The George Washington University","institution_ids":["https://openalex.org/I193531525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002254350","display_name":"H. Howie Huang","orcid":"https://orcid.org/0000-0001-8588-7680"},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Howie Huang","raw_affiliation_strings":["The George Washington University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The George Washington University","institution_ids":["https://openalex.org/I193531525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193531525"],"apc_list":null,"apc_paid":null,"fwci":0.4563,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75964841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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/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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.775898277759552},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.58723384141922},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.58202064037323},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5537819862365723},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5522253513336182},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44081997871398926},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.42427825927734375},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.421773225069046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41079550981521606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3637881278991699},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.15950411558151245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1418769359588623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09996247291564941}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.775898277759552},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.58723384141922},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.58202064037323},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5537819862365723},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5522253513336182},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44081997871398926},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.42427825927734375},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.421773225069046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41079550981521606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3637881278991699},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.15950411558151245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1418769359588623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09996247291564941},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2018.8547523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2038224551","https://openalex.org/W2048713010","https://openalex.org/W2056760934","https://openalex.org/W2059676477","https://openalex.org/W2119998616","https://openalex.org/W2138309709","https://openalex.org/W2144767994","https://openalex.org/W2146292423","https://openalex.org/W2169148563","https://openalex.org/W2749718357","https://openalex.org/W2752751166","https://openalex.org/W2765108993","https://openalex.org/W2766047361","https://openalex.org/W3098858271","https://openalex.org/W3105877611","https://openalex.org/W4235599520","https://openalex.org/W6745388056"],"related_works":["https://openalex.org/W1549987457","https://openalex.org/W2025912669","https://openalex.org/W1977789739","https://openalex.org/W2014615094","https://openalex.org/W2047470742","https://openalex.org/W2351778335","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2767131998","https://openalex.org/W3139829055"],"abstract_inverted_index":{"The":[0],"graph":[1,11,15,37,58,131],"partition":[2,95],"problem":[3],"continues":[4],"to":[5,101,159],"be":[6],"challenging,":[7],"particularly":[8],"for":[9,33,51,122,126,129,147,157,161],"streaming":[10,57,149],"data.":[12,38,59],"Although":[13],"optimal":[14],"partitioning":[16,54,109],"is":[17,62,154],"NP-hard,":[18],"stochastic":[19,52],"methods":[20,30],"can":[21],"provide":[22],"approximate":[23],"solutions":[24],"in":[25,144],"reasonable":[26],"time.":[27],"However,":[28],"such":[29],"are":[31,88],"optimized":[32],"static,":[34],"not":[35],"dynamic":[36],"In":[39],"this":[40],"paper,":[41],"we":[42,48],"describe":[43],"a":[44,63,93,107,130],"new":[45,86],"efficient":[46],"algorithm":[47,61,68,78,117],"have":[49],"developed":[50],"block":[53],"on":[55],"time-varying,":[56],"Our":[60,76],"refinement":[64],"of":[65,69],"the":[66,70,102,140,142,152],"baseline":[67,104,153],"IEEE":[71],"HPEC":[72],"Graph":[73],"Challenge":[74],"[1].":[75],"incremental":[77],"efficiently":[79],"updates":[80],"its":[81],"previous":[82],"internal":[83],"state":[84],"as":[85],"pieces":[87,150],"streamed":[89,132],"in,":[90],"and":[91,124],"generates":[92],"complete":[94,108],"at":[96,112],"every":[97,113],"time":[98,114,146],"step.":[99],"Compared":[100],"naive":[103],"which":[105],"performs":[106],"from":[110],"scratch":[111],"step,":[115],"our":[116],"offers":[118],"speedups":[119],"between":[120,155],"1.96x":[121],"N=500":[123,158],"3.56x":[125],"N=20k":[127],"overall,":[128],"over":[133,151],"10":[134],"parts,":[135],"with":[136],"similar":[137],"accuracy.":[138],"At":[139],"margin,":[141],"speedup":[143],"processing":[145],"additional":[148],"7.1x":[156],"25.1x":[160],"N=20k.":[162]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}