{"id":"https://openalex.org/W4360765062","doi":"https://doi.org/10.1109/asonam55673.2022.10068613","title":"Faster Greedy Optimization of Resistance-based Graph Robustness","display_name":"Faster Greedy Optimization of Resistance-based Graph Robustness","publication_year":2022,"publication_date":"2022-11-10","ids":{"openalex":"https://openalex.org/W4360765062","doi":"https://doi.org/10.1109/asonam55673.2022.10068613"},"language":"en","primary_location":{"id":"doi:10.1109/asonam55673.2022.10068613","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asonam55673.2022.10068613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","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/A5007916502","display_name":"Maria Predari","orcid":"https://orcid.org/0000-0002-9545-0623"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Maria Predari","raw_affiliation_strings":["Humboldt-Universit&#x00E4;t zu Berlin,Department of Computer Science,Berlin,Germany"],"affiliations":[{"raw_affiliation_string":"Humboldt-Universit&#x00E4;t zu Berlin,Department of Computer Science,Berlin,Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084761980","display_name":"Robert E. Kooij","orcid":"https://orcid.org/0000-0001-8654-1550"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robert Kooij","raw_affiliation_strings":["Delft University of Technology,Faculty of Electrical Engineering, Mathematics and Computer Science,Delft,The Netherlands","Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology,Faculty of Electrical Engineering, Mathematics and Computer Science,Delft,The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Humboldt-Universit&#x00E4;t zu Berlin,Department of Computer Science,Berlin,Germany"],"affiliations":[{"raw_affiliation_string":"Humboldt-Universit&#x00E4;t zu Berlin,Department of Computer Science,Berlin,Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007916502"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":0.5555,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73454908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9972000122070312,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9937000274658203,"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/T11476","display_name":"Graph theory and applications","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5535931587219238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5348191857337952},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.49762728810310364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47030109167099},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4691449701786041},{"id":"https://openalex.org/keywords/laplacian-matrix","display_name":"Laplacian matrix","score":0.4691397547721863},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.456678569316864},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41806846857070923},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4102681875228882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3382444679737091},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33578717708587646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2947172522544861},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2021208107471466}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5535931587219238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5348191857337952},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.49762728810310364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47030109167099},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4691449701786041},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.4691397547721863},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.456678569316864},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41806846857070923},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4102681875228882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3382444679737091},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33578717708587646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2947172522544861},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2021208107471466},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/asonam55673.2022.10068613","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asonam55673.2022.10068613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","raw_type":"proceedings-article"},{"id":"pmh:oai:oai-pmh.tno.nl:66689","is_oa":false,"landing_page_url":"https://resolver.tno.nl/uuid:a8f664ec-d521-47dc-b709-bba52ae27de6","pdf_url":null,"source":{"id":"https://openalex.org/S7407055233","display_name":"TNO Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G73367682","display_name":null,"funder_award_id":"ME 3619/4-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W638149299","https://openalex.org/W1514107797","https://openalex.org/W1587744656","https://openalex.org/W1898824936","https://openalex.org/W1987717935","https://openalex.org/W1989400610","https://openalex.org/W2011655084","https://openalex.org/W2016885155","https://openalex.org/W2021272950","https://openalex.org/W2030995892","https://openalex.org/W2064713711","https://openalex.org/W2070448527","https://openalex.org/W2076736217","https://openalex.org/W2078394884","https://openalex.org/W2096646197","https://openalex.org/W2151119255","https://openalex.org/W2156286761","https://openalex.org/W2160643434","https://openalex.org/W2167923946","https://openalex.org/W2168832879","https://openalex.org/W2265341574","https://openalex.org/W2278879613","https://openalex.org/W2294347342","https://openalex.org/W2512878932","https://openalex.org/W2735792691","https://openalex.org/W2755628595","https://openalex.org/W2903351184","https://openalex.org/W2954172701","https://openalex.org/W2963378845","https://openalex.org/W2963794747","https://openalex.org/W2968699064","https://openalex.org/W2979473749","https://openalex.org/W3044284408","https://openalex.org/W3094856368","https://openalex.org/W3099535088","https://openalex.org/W3201929650","https://openalex.org/W4245821426","https://openalex.org/W4292070111","https://openalex.org/W6742341998","https://openalex.org/W6779903964","https://openalex.org/W6780863167"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187"],"abstract_inverted_index":{"The":[0,51,70],"total":[1,43,52],"effective":[2,44,53,56],"resistance,":[3],"also":[4],"called":[5],"the":[6,22,38,64,67,113,134,161,164,178,192],"Kirchhoff":[7],"index,":[8],"provides":[9],"a":[10,14,120],"robustness":[11],"measure":[12],"for":[13,159],"graph":[15,40,68],"<tex":[16,27,33,187],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[17,28,34,188],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$G$</tex>":[18,35],".":[19],"We":[20,88],"consider":[21],"optimization":[23],"problem":[24],"of":[25,66,115,163,194],"adding":[26],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[29],"new":[30],"edges":[31],"to":[32,95,111,180,183],"such":[36],"that":[37,152],"resulting":[39],"has":[41],"minimal":[42],"resistance":[45,54],"(i.":[46],"e.,":[47],"is":[48,145],"most":[49],"robust).":[50],"and":[55,85,92,126,144],"resistances":[57],"between":[58],"nodes":[59,190],"can":[60,154],"be":[61,73,181],"computed":[62,74],"using":[63],"pseudoinverse":[65,71],"Laplacian.":[69],"may":[72],"explicitly":[75],"via":[76],"pseudoinversion;":[77],"yet,":[78],"this":[79],"takes":[80],"cubic":[81],"time":[82],"in":[83,100,191],"practice":[84],"quadratic":[86],"space.":[87],"instead":[89],"exploit":[90],"combinatorial":[91],"algebraic":[93],"connections":[94],"speed":[96],"up":[97],"gain":[98],"computations":[99],"established":[101],"generic":[102],"greedy":[103,136,166],"heuristics.":[104],"Moreover,":[105],"we":[106,153,174,176],"leverage":[107],"existing":[108],"randomized":[109],"techniques":[110],"boost":[112],"performance":[114],"our":[116],"approaches":[117,128],"by":[118],"introducing":[119],"sub-sampling":[121],"step.":[122],"Our":[123,149],"different":[124],"graph-":[125],"matrix-based":[127],"are":[129,177],"indeed":[130],"significantly":[131],"faster":[132],"than":[133],"state-of-the-art":[135,165],"algorithm,":[137],"while":[138],"their":[139],"quality":[140],"remains":[141],"reasonably":[142],"high":[143],"often":[146],"quite":[147],"close.":[148],"experiments":[150],"show":[151],"now":[155],"process":[156,184],"large":[157],"graphs":[158,185],"which":[160],"application":[162],"approach":[167],"was":[168],"infeasible":[169],"before.":[170],"As":[171],"far":[172],"as":[173],"know,":[175],"first":[179],"able":[182],"with":[186],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$100K+$</tex>":[189],"order":[193],"minutes.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}