{"id":"https://openalex.org/W2412465557","doi":"https://doi.org/10.1145/2907294.2907312","title":"Efficient Processing of Large Graphs via Input Reduction","display_name":"Efficient Processing of Large Graphs via Input Reduction","publication_year":2016,"publication_date":"2016-05-31","ids":{"openalex":"https://openalex.org/W2412465557","doi":"https://doi.org/10.1145/2907294.2907312","mag":"2412465557"},"language":"en","primary_location":{"id":"doi:10.1145/2907294.2907312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2907294.2907312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing","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/A5071632654","display_name":"Amlan Kusum","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amlan Kusum","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054794473","display_name":"Keval Vora","orcid":"https://orcid.org/0000-0002-5462-5116"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keval Vora","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100699251","display_name":"Rajiv Gupta","orcid":"https://orcid.org/0000-0002-9348-3974"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gupta","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012137980","display_name":"Iulian Neamtiu","orcid":"https://orcid.org/0000-0001-9730-9650"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iulian Neamtiu","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ, USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071632654"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":2.5051,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.92956517,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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/computer-science","display_name":"Computer science","score":0.7892211675643921},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6862287521362305},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.6380273103713989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5437880158424377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5295634865760803},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5237940549850464},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.5052571892738342},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.43759018182754517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.392234742641449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11787709593772888},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.10327056050300598}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7892211675643921},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6862287521362305},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.6380273103713989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5437880158424377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5295634865760803},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5237940549850464},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.5052571892738342},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.43759018182754517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.392234742641449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11787709593772888},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.10327056050300598},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2907294.2907312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2907294.2907312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2646760259","display_name":null,"funder_award_id":"CCF-1318103, CCF-1524852","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W97348994","https://openalex.org/W131619556","https://openalex.org/W134051198","https://openalex.org/W1527104720","https://openalex.org/W1788180225","https://openalex.org/W1957118585","https://openalex.org/W1969970763","https://openalex.org/W1974709826","https://openalex.org/W1981893977","https://openalex.org/W1982003698","https://openalex.org/W2000041758","https://openalex.org/W2004951603","https://openalex.org/W2011963492","https://openalex.org/W2014620461","https://openalex.org/W2040011014","https://openalex.org/W2045271686","https://openalex.org/W2053076698","https://openalex.org/W2070232376","https://openalex.org/W2082227928","https://openalex.org/W2096544401","https://openalex.org/W2109410003","https://openalex.org/W2114703523","https://openalex.org/W2115052164","https://openalex.org/W2118953734","https://openalex.org/W2123468241","https://openalex.org/W2126021606","https://openalex.org/W2131071574","https://openalex.org/W2142883190","https://openalex.org/W2156745311","https://openalex.org/W2170616854","https://openalex.org/W2170881177","https://openalex.org/W2244358235","https://openalex.org/W2295258302","https://openalex.org/W2734941459","https://openalex.org/W2951113132","https://openalex.org/W4232836277","https://openalex.org/W4285719527","https://openalex.org/W6603975009","https://openalex.org/W6639805184"],"related_works":["https://openalex.org/W3008339103","https://openalex.org/W2404647514","https://openalex.org/W2106626222","https://openalex.org/W1667647204","https://openalex.org/W3119814709","https://openalex.org/W2018477250","https://openalex.org/W4376609224","https://openalex.org/W4251763581","https://openalex.org/W2770410918","https://openalex.org/W3142785668"],"abstract_inverted_index":{"Large-scale":[0],"parallel":[1],"graph":[2,28,36,41,47,82,95],"analytics":[3],"involves":[4],"executing":[5],"iterative":[6,27,72],"algorithms":[7,29],"(e.g.,":[8],"PageRank,":[9],"Shortest":[10],"Paths,":[11],"etc.)":[12],"that":[13,67,121,150,165],"are":[14,59,127],"both":[15],"data-":[16],"and":[17,89,114,118],"compute-intensive.":[18],"In":[19],"this":[20],"work":[21],"we":[22],"construct":[23],"faster":[24],"versions":[25],"of":[26,51,133,156,183],"from":[30,100],"their":[31],"original":[32,71,93],"counterparts":[33],"using":[34,48,61,78,91,136],"input":[35,40,52,81,94,111,147,159],"reduction.":[37],"A":[38],"large":[39],"is":[42],"transformed":[43],"into":[44],"a":[45,49,145,153],"small":[46,199],"sequence":[50,155],"reduction":[53,112,148,160],"transformations.":[54,161],"Savings":[55],"in":[56,74,86,125,172],"execution":[57,87,173],"time":[58,174],"achieved":[60],"our":[62,137,166],"two":[63,75,138],"phased":[64,139],"processing":[65,140],"model":[66],"effectively":[68],"runs":[69],"the":[70,79,92,98,101,116,131,184,194],"algorithm":[73,149],"phases:":[76],"first,":[77],"reduced":[80],"to":[83,129],"gain":[84],"savings":[85],"time;":[88],"second,":[90],"along":[96],"with":[97],"results":[99,134,180,190],"first":[102],"phase":[103],"for":[104,181],"computing":[105],"precise":[106,178,189],"results.":[107],"We":[108,142],"propose":[109],"several":[110],"transformations":[113],"identify":[115],"structural":[117],"non-structural":[119],"properties":[120],"they":[122],"guarantee,":[123],"which":[124],"turn":[126],"used":[128],"ensure":[130],"correctness":[132],"while":[135,176],"model.":[141],"further":[143],"present":[144],"unified":[146],"efficiently":[151],"applies":[152],"non-interfering":[154],"simple":[157],"local":[158],"Our":[162],"experiments":[163],"show":[164],"transformation":[167],"techniques":[168],"enable":[169],"significant":[170],"reductions":[171],"(1.25x-2.14x)":[175],"achieving":[177],"final":[179],"most":[182,201],"algorithms.":[185],"For":[186],"cases":[187],"where":[188],"cannot":[191],"be":[192],"achieved,":[193],"relative":[195],"error":[196],"remains":[197],"very":[198],"(at":[200],"0.065).":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}