{"id":"https://openalex.org/W2890698010","doi":null,"title":"Fast Dominating Set Algorithms for Social Networks.","display_name":"Fast Dominating Set Algorithms for Social Networks.","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2890698010","mag":"2890698010"},"language":"en","primary_location":{"id":"mag:2890698010","doi":null,"is_oa":false,"landing_page_url":"http://ceur-ws.org/Vol-1353/paper_16.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306519080","display_name":"MAICS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"MAICS","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5109458663","display_name":"Alina C\u00e2mpan","orcid":"https://orcid.org/0000-0002-9296-3036","observed_orcids":["https://orcid.org/0000-0002-9296-3036"]},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alina C\u00e2mpan","raw_affiliation_strings":["Northern Kentucky Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northern Kentucky Univ","institution_ids":["https://openalex.org/I168416876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067651880","display_name":"Traian Marius Tru\u0163\u0103","orcid":"https://orcid.org/0000-0001-9447-4861","observed_orcids":["https://orcid.org/0000-0001-9447-4861"]},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Traian Marius Tru\u0163\u0103","raw_affiliation_strings":["Northern Kentucky Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northern Kentucky Univ","institution_ids":["https://openalex.org/I168416876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038289527","display_name":"Matthew Beckerich","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Beckerich","raw_affiliation_strings":["Northern Kentucky Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northern Kentucky Univ","institution_ids":["https://openalex.org/I168416876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168416876"],"apc_list":null,"apc_paid":null,"fwci":1.372,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.83055444,"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":"55","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7002000212669373,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7002000212669373,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.2054000049829483,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05810000002384186,"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/minimum-dominating-set","display_name":"minimum dominating set","score":0.9179999828338623},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7559999823570251},{"id":"https://openalex.org/keywords/social-networks","display_name":"social networks","score":0.9660000205039978},{"id":"https://openalex.org/keywords/dominating-set-problem","display_name":"dominating set problem","score":0.6320000290870667},{"id":"https://openalex.org/keywords/power-law-networks","display_name":"power-law networks","score":0.8240000009536743},{"id":"https://openalex.org/keywords/random-networks","display_name":"random networks","score":0.7459999918937683},{"id":"https://openalex.org/keywords/network-analysis","display_name":"network analysis","score":0.4020000100135803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7208751440048218},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6211783289909363},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.569744884967804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5604473948478699},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5380802154541016},{"id":"https://openalex.org/C114713312","wikidata":"https://www.wikidata.org/wiki/Q7551269","display_name":"Social network analysis","level":3,"score":0.43099868297576904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26773616671562195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07437381148338318},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C518677369","wikidata":"https://www.wikidata.org/wiki/Q202833","display_name":"Social media","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2890698010","doi":null,"is_oa":false,"landing_page_url":"http://ceur-ws.org/Vol-1353/paper_16.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306519080","display_name":"MAICS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"MAICS","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1567678169","https://openalex.org/W1980243423","https://openalex.org/W1999667176","https://openalex.org/W2011039300","https://openalex.org/W2038550366","https://openalex.org/W2044881936","https://openalex.org/W2045349136","https://openalex.org/W2058508948","https://openalex.org/W2066561381","https://openalex.org/W2083750870","https://openalex.org/W2095334215","https://openalex.org/W2096495231","https://openalex.org/W2111769183","https://openalex.org/W2163322487","https://openalex.org/W2257961952","https://openalex.org/W2469279958","https://openalex.org/W2493410043"],"related_works":["https://openalex.org/W4256681019","https://openalex.org/W2205962382","https://openalex.org/W3112921827","https://openalex.org/W2976146672","https://openalex.org/W7223551100","https://openalex.org/W2090222354","https://openalex.org/W2293431589","https://openalex.org/W4321504808","https://openalex.org/W2772081234","https://openalex.org/W6997314153"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,64],"introduce":[4],"two":[5,42],"novel":[6],"algorithms":[7,43,96],"that":[8,69,93],"are":[9,97],"able":[10],"to":[11,16,35],"efficiently":[12],"determine":[13],"an":[14,36],"approximation":[15],"the":[17,24,30,33,85,94,106],"minimum":[18,107],"dominating":[19,108],"set":[20,109],"problem,":[21],"and":[22,55,73,76,99],"at":[23],"same":[25],"time,":[26],"they":[27],"will":[28],"preserve":[29],"quality":[31],"of":[32,52,110],"solution":[34],"acceptable":[37],"level.":[38],"We":[39],"compare":[40],"these":[41],"with":[44],"three":[45],"existing":[46],"algorithms,":[47],"for":[48,56,104],"a":[49,77,111],"large":[50],"number":[51],"synthetic":[53],"datasets,":[54],"several":[57],"real":[58,79],"world":[59],"social":[60,66,112],"networks.":[61],"For":[62],"experiments,":[63],"use":[65],"network":[67,80],"generators":[68],"create":[70],"both":[71],"power-law":[72],"random":[74],"networks,":[75],"few":[78],"datasets":[81],"made":[82],"available":[83],"by":[84],"Stanford":[86],"Network":[87],"Analysis":[88],"Project.":[89],"Our":[90],"experiments":[91],"show":[92],"proposed":[95],"viable,":[98],"in":[100],"many":[101],"instances,":[102],"preferable":[103],"determining":[105],"network.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2018-09-27T00:00:00"}