{"id":"https://openalex.org/W4360765067","doi":"https://doi.org/10.1109/asonam55673.2022.10068586","title":"Minimizing the Importance Inequality of Nodes in a Social Network Graph","display_name":"Minimizing the Importance Inequality of Nodes in a Social Network Graph","publication_year":2022,"publication_date":"2022-11-10","ids":{"openalex":"https://openalex.org/W4360765067","doi":"https://doi.org/10.1109/asonam55673.2022.10068586"},"language":"en","primary_location":{"id":"doi:10.1109/asonam55673.2022.10068586","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/asonam55673.2022.10068586","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/A5078094592","display_name":"Ahmad Zareie","orcid":"https://orcid.org/0000-0002-2081-8112"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ahmad Zareie","raw_affiliation_strings":["The University of Manchester,Department of Computer Science,Manchester,U.K","Department of Computer Science, The University of Manchester, Manchester, U.K"],"affiliations":[{"raw_affiliation_string":"The University of Manchester,Department of Computer Science,Manchester,U.K","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, The University of Manchester, Manchester, U.K","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079821707","display_name":"Rizos Sakellariou","orcid":"https://orcid.org/0000-0002-6104-6649"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rizos Sakellariou","raw_affiliation_strings":["The University of Manchester,Department of Computer Science,Manchester,U.K","Department of Computer Science, The University of Manchester, Manchester, U.K"],"affiliations":[{"raw_affiliation_string":"The University of Manchester,Department of Computer Science,Manchester,U.K","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, The University of Manchester, Manchester, U.K","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078094592"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17741686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"75","issue":null,"first_page":"194","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9983999729156494,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9699000120162964,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.949999988079071,"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/heuristics","display_name":"Heuristics","score":0.8288213014602661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6023537516593933},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5955401062965393},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5163842439651489},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49096205830574036},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.47915905714035034},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41683444380760193},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.4107920527458191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32783517241477966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3079881966114044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24719363451004028},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1184113621711731}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8288213014602661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6023537516593933},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5955401062965393},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5163842439651489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49096205830574036},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.47915905714035034},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41683444380760193},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.4107920527458191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32783517241477966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3079881966114044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24719363451004028},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1184113621711731},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/asonam55673.2022.10068586","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/asonam55673.2022.10068586","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:pure.atira.dk:openaire_cris_publications/1ae65003-af2a-4059-a0ad-21c2bc8f4d00","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/1ae65003-af2a-4059-a0ad-21c2bc8f4d00","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zareie, A & Sakellariou, R 2022, Minimizing the Importance Inequality of Nodes in a Social Network Graph. in IEEE.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5799999833106995,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1527104720","https://openalex.org/W1580292412","https://openalex.org/W1951028534","https://openalex.org/W1971937094","https://openalex.org/W1973522621","https://openalex.org/W2012909434","https://openalex.org/W2014732416","https://openalex.org/W2026363362","https://openalex.org/W2036265926","https://openalex.org/W2056944867","https://openalex.org/W2094224753","https://openalex.org/W2128438887","https://openalex.org/W2139882553","https://openalex.org/W2171707538","https://openalex.org/W2270368980","https://openalex.org/W2317739826","https://openalex.org/W2344526012","https://openalex.org/W2407891964","https://openalex.org/W2470757901","https://openalex.org/W2484873874","https://openalex.org/W2592818482","https://openalex.org/W2766151159","https://openalex.org/W2788422168","https://openalex.org/W2790211287","https://openalex.org/W2791395754","https://openalex.org/W2802038099","https://openalex.org/W2963975915","https://openalex.org/W2988171316","https://openalex.org/W3081897388","https://openalex.org/W3103657871","https://openalex.org/W3106329802","https://openalex.org/W3157186187","https://openalex.org/W3160491517","https://openalex.org/W3167683174","https://openalex.org/W4313372450","https://openalex.org/W6736535771","https://openalex.org/W6749263295"],"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":{"Network":[0],"graphs":[1],"are":[2,181],"widely":[3],"used":[4],"to":[5,85,109,127,131,183],"model":[6],"a":[7,27,40,51,92,114,117,136,149,160],"variety":[8],"of":[9,29,70,88,101,143,152,190],"real-world":[10,179],"interactions.":[11],"In":[12],"such":[13],"graphs,":[14],"nodes":[15,48,72],"do":[16],"not":[17,55],"have":[18,36,56],"the":[19,23,30,57,61,67,71,86,99,124,140,144,153,185],"same":[20,58],"importance":[21,89,102,141],"in":[22,66,81,91,113,135,188],"graph":[24,119],"structure":[25],"as":[26],"result":[28],"graph's":[31],"topological":[32],"properties.":[33],"This":[34,94],"may":[35,54,106],"various":[37],"implications":[38],"concerning":[39],"network's":[41],"behaviour":[42],"as,":[43],"for":[44,60],"example,":[45],"how":[46],"different":[47,78],"operate":[49],"(even":[50],"node's":[52],"failure)":[53],"impact":[59],"whole":[62],"network.":[63,115],"The":[64,146],"differences":[65],"structural":[68],"properties":[69,112],"imply":[73],"that":[74,138,171],"each":[75],"node":[76],"has":[77],"importance,":[79],"which,":[80],"turn,":[82],"gives":[83],"rise":[84],"notion":[87],"inequality":[90,103,142],"graph.":[93,145],"paper":[95,147],"defines":[96],"and":[97,120,155,192],"addresses":[98],"problem":[100,125,154],"minimization,":[104],"which":[105,166],"be":[107],"useful":[108],"achieve":[110],"certain":[111],"Given":[116],"network":[118],"an":[121],"integer":[122],"<tex>$k$</tex>,":[123],"aims":[126],"identify":[128],"<tex>$k$</tex>":[129],"edges":[130],"connect":[132],"non-adjacent":[133],"nodes,":[134],"way":[137],"minimizes":[139],"provides":[148],"formal":[150],"definition":[151],"proves":[156],"its":[157,173],"NP-hardness.":[158],"Then,":[159],"naive":[161],"greedy":[162],"method":[163],"is":[164,167],"proposed,":[165],"enhanced":[168],"by":[169],"heuristics":[170],"make":[172],"use":[174],"practical.":[175],"Experiments":[176],"using":[177],"8":[178],"networks":[180],"conducted":[182],"evaluate":[184],"proposed":[186],"methods":[187],"terms":[189],"effectiveness":[191],"efficiency.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}