{"id":"https://openalex.org/W4416430082","doi":"https://doi.org/10.1109/iccad66269.2025.11240980","title":"dyGRASS: Dynamic Spectral Graph Sparsification via Localized Random Walks on GPUs","display_name":"dyGRASS: Dynamic Spectral Graph Sparsification via Localized Random Walks on GPUs","publication_year":2025,"publication_date":"2025-10-26","ids":{"openalex":"https://openalex.org/W4416430082","doi":"https://doi.org/10.1109/iccad66269.2025.11240980"},"language":null,"primary_location":{"id":"doi:10.1109/iccad66269.2025.11240980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad66269.2025.11240980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","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/A5113107414","display_name":"Yihang Yuan","orcid":"https://orcid.org/0000-0002-4114-898X"},"institutions":[{"id":"https://openalex.org/I108468826","display_name":"Stevens Institute of Technology","ror":"https://ror.org/02z43xh36","country_code":"US","type":"education","lineage":["https://openalex.org/I108468826"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yihang Yuan","raw_affiliation_strings":["Stevens Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Stevens Institute of Technology","institution_ids":["https://openalex.org/I108468826"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035687215","display_name":"Ali Aghdaei","orcid":"https://orcid.org/0000-0001-7903-5246"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Aghdaei","raw_affiliation_strings":["University of California,San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111483945","display_name":"Zhuo Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I108468826","display_name":"Stevens Institute of Technology","ror":"https://ror.org/02z43xh36","country_code":"US","type":"education","lineage":["https://openalex.org/I108468826"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhuo Feng","raw_affiliation_strings":["Stevens Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Stevens Institute of Technology","institution_ids":["https://openalex.org/I108468826"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113107414"],"corresponding_institution_ids":["https://openalex.org/I108468826"],"apc_list":null,"apc_paid":null,"fwci":1.2181,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85241872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.7134000062942505,"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.7134000062942505,"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.18979999423027039,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02199999988079071,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7329000234603882},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6567999720573425},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5259000062942505},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.49070000648498535},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.4851999878883362},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48159998655319214},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.45249998569488525},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.38749998807907104},{"id":"https://openalex.org/keywords/graph-layout","display_name":"Graph Layout","score":0.3668000102043152},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3540000021457672}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7329000234603882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6955000162124634},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6567999720573425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5400000214576721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5259000062942505},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.49070000648498535},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48159998655319214},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38940000534057617},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C2911174283","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph Layout","level":4,"score":0.3668000102043152},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34860000014305115},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.29510000348091125},{"id":"https://openalex.org/C2780056265","wikidata":"https://www.wikidata.org/wiki/Q106239881","display_name":"High dynamic range","level":3,"score":0.2921000123023987},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2639000117778778},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C23463724","wikidata":"https://www.wikidata.org/wiki/Q2308831","display_name":"Spectral method","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.2535000145435333},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad66269.2025.11240980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad66269.2025.11240980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":33,"referenced_works":["https://openalex.org/W1776822698","https://openalex.org/W1974239096","https://openalex.org/W2048572907","https://openalex.org/W2067081844","https://openalex.org/W2076796919","https://openalex.org/W2125664420","https://openalex.org/W2129575457","https://openalex.org/W2164853353","https://openalex.org/W2336483534","https://openalex.org/W2396255976","https://openalex.org/W2594480752","https://openalex.org/W2624677037","https://openalex.org/W2769682656","https://openalex.org/W2769943877","https://openalex.org/W2963324223","https://openalex.org/W2996843076","https://openalex.org/W3000806433","https://openalex.org/W3007195951","https://openalex.org/W3046133410","https://openalex.org/W3087202534","https://openalex.org/W3131684815","https://openalex.org/W3169491177","https://openalex.org/W3185087212","https://openalex.org/W4242608849","https://openalex.org/W4282935176","https://openalex.org/W4282936022","https://openalex.org/W4292387396","https://openalex.org/W4293023278","https://openalex.org/W4312268114","https://openalex.org/W4315489376","https://openalex.org/W4323022461","https://openalex.org/W4393140657","https://openalex.org/W4404133205"],"related_works":[],"abstract_inverted_index":{"This":[0,111],"work":[1],"presents":[2],"dyGRASS,":[3],"an":[4],"efficient":[5],"dynamic":[6,170],"algorithm":[7,144],"for":[8,168],"spectral":[9,156],"sparsification":[10,142,157],"of":[11,56,76,120,183],"large":[12],"undirected":[13],"graphs":[14],"that":[15,100,130],"undergo":[16],"streaming":[17],"edge":[18,175],"insertions":[19,176],"and":[20,43,118,150,164,177,194],"deletions.":[21],"At":[22],"its":[23,44],"core,":[24],"dyGRASS":[25,52,72,92,123,131,160],"employs":[26,93],"a":[27,94,134,180],"random-walk-based":[28],"method":[29],"to":[30,63,104,138],"efficiently":[31],"estimate":[32],"node-to-node":[33],"distances":[34],"in":[35,154],"both":[36,115,174],"the":[37,54,61,65,74,80,85,116,121,139,147],"original":[38,81],"graph":[39,82,171,184],"(for":[40,46],"decremental":[41,70],"update)":[42],"sparsifier":[45],"incremental":[47,50,141,155],"update).":[48],"For":[49,69],"updates,":[51,71],"enables":[53],"identification":[55],"spectrally":[57],"critical":[58],"edges":[59,78],"among":[60],"updates":[62],"capture":[64],"latest":[66],"structural":[67],"changes.":[68],"facilitates":[73],"recovery":[75],"important":[77],"from":[79,187],"back":[83],"into":[84],"sparsifier.":[86],"To":[87],"further":[88],"enhance":[89],"computational":[90],"efficiency,":[91],"GPU-based":[95],"non-backtracking":[96],"random":[97],"walk":[98],"scheme":[99],"allows":[101],"multiple":[102],"walkers":[103],"operate":[105],"simultaneously":[106],"across":[107,179],"various":[108],"target":[109],"updates.":[110],"parallelization":[112],"significantly":[113],"improves":[114],"performance":[117],"scalability":[119],"proposed":[122],"framework.":[124],"Our":[125],"comprehensive":[126],"experimental":[127],"evaluations":[128],"reveal":[129],"achieves":[132],"approximately":[133],"10\u00d7":[135],"speedup":[136],"compared":[137],"state-of-the-art":[140],"(inGRASS)":[143],"while":[145],"eliminating":[146],"setup":[148],"overhead":[149],"improving":[151],"solution":[152,166],"quality":[153,167],"tasks.":[158],"Moreover,":[159],"delivers":[161],"high":[162],"efficiency":[163],"superior":[165],"fully":[169],"sparsification,":[172],"accommodating":[173],"deletions":[178],"diverse":[181],"range":[182],"instances":[185],"originating":[186],"integrated":[188],"circuit":[189],"simulations,":[190],"finite":[191],"element":[192],"analysis,":[193],"social":[195],"networks.":[196],"We":[197],"release":[198],"our":[199],"full":[200],"implementation":[201],"at:":[202],"https://github.com/Feng-Research/dyGRASS":[203]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-20T00:00:00"}