{"id":"https://openalex.org/W6888556222","doi":"https://doi.org/10.21227/bjwq-z470","title":"Data Set and Source Files of Two Approaches to Constructing Certified Dominating Sets in Social Networks","display_name":"Data Set and Source Files of Two Approaches to Constructing Certified Dominating Sets in Social Networks","publication_year":2024,"publication_date":"2024-12-03","ids":{"openalex":"https://openalex.org/W6888556222","doi":"https://doi.org/10.21227/bjwq-z470"},"language":"en","primary_location":{"id":"doi:10.21227/bjwq-z470","is_oa":true,"landing_page_url":"https://doi.org/10.21227/bjwq-z470","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"type":"dataset","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.21227/bjwq-z470","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Raczek, Joanna","orcid":null},"institutions":[{"id":"https://openalex.org/I169333911","display_name":"Gda\u0144sk University of Technology","ror":"https://ror.org/006x4sc24","country_code":"PL","type":"education","lineage":["https://openalex.org/I169333911"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Raczek, Joanna","raw_affiliation_strings":["Gda\u0144sk University of Technology"],"affiliations":[{"raw_affiliation_string":"Gda\u0144sk University of Technology","institution_ids":["https://openalex.org/I169333911"]}]},{"author_position":"last","author":{"id":null,"display_name":"Miotk, Mateusz","orcid":null},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Miotk, Mateusz","raw_affiliation_strings":["University of Gda\u0144sk"],"affiliations":[{"raw_affiliation_string":"University of Gda\u0144sk","institution_ids":["https://openalex.org/I40413290"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169333911"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.8986999988555908},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5418999791145325},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5235999822616577},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48829999566078186},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41370001435279846},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.375},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3617999851703644}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.8986999988555908},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5418999791145325},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5235999822616577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5102999806404114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48829999566078186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4593000113964081},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.375},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3528999984264374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30559998750686646},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.29739999771118164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29100000858306885},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.27959999442100525},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25450000166893005},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21227/bjwq-z470","is_oa":true,"landing_page_url":"https://doi.org/10.21227/bjwq-z470","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"dataset"}],"best_oa_location":{"id":"doi:10.21227/bjwq-z470","is_oa":true,"landing_page_url":"https://doi.org/10.21227/bjwq-z470","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Two":[0],"Approaches":[1],"to":[2,104,168,250,276,316],"Constructing":[3],"Certified":[4],"Dominating":[5,81,215],"Sets":[6],"in":[7,51,61,125,248,281,352,362],"Social":[8],"Networks:":[9],"R":[10],"Script":[11],"DescriptionThis":[12],"script":[13,34],"implements":[14],"and":[15,29,44,47,56,83,90,137,211,239,264,297,326,379],"analyzes":[16],"various":[17,295],"algorithms":[18,291],"for":[19,65,92,108,292,311,340,376],"graph":[20,115,175,218,247],"processing,":[21],"focusing":[22],"on":[23,181,270],"domination":[24,28],"problems,":[25],"including":[26],"double":[27,203,236,371],"certified":[30,39,172,199],"dominating":[31,40,99,140,163,173,191,200,204,223,227,237,254,284,338,372],"sets.Script":[32],"OverviewThe":[33],"generates":[35],"tree":[36,71,114,134,246],"graphs,":[37],"calculates":[38],"sets":[41,96],"using":[42,142,206,256],"ApproxCert":[43,166],"other":[45],"algorithms,":[46],"evaluates":[48],"their":[49,182],"performance":[50],"terms":[52],"of":[53,76,120,123,197,209,234,242,279,294,303,307,324,329,347,360,369],"execution":[54,88,240],"time":[55,258],"results.":[57],"Results":[58],"are":[59,97,188,344,350],"saved":[60,351],"a":[62,105,112,117,139,143,202,207,245,334,337,353],"CSV":[63,106,320,354],"file":[64,107,321,355],"further":[66,109],"analysis.Key":[67],"FeaturesTree":[68],"Generation: Creates":[69],"random":[70,113],"graphs":[72,293],"with":[73,116,151,157,356],"specified":[74,118],"numbers":[75],"nodes.Domination":[77],"Algorithms: Implements":[78],"ApproxCert,":[79],"Greedy":[80],"Set,":[82],"Double":[84],"Domination":[85],"algorithms.Performance":[86],"Evaluation: Measures":[87],"times":[89,241,328],"results":[91,103,346],"different":[93,330],"algorithms.Validation: Ensures":[94],"computed":[95],"valid":[98],"sets.Results":[100],"Export: Saves":[101],"detailed":[102],"analysis.Main":[110],"Componentsgenerate_tree(count)Generates":[111],"number":[119,302,306],"nodes.Input: count -":[121],"Number":[122],"nodes":[124,178,187,261,280,343,361],"the":[126,131,133,149,152,162,165,190,198,226,232,235,243,282,289,299,318,348,357,363,370],"tree.Output: An":[127],"`igraph`":[128],"object":[129],"representing":[130],"tree.Details: Ensures":[132],"is":[135],"undirected":[136],"connected.greedy_dominating_set(G)Computes":[138],"set":[141,192,205,224,228,238,255,339],"greedy":[144,210],"algorithm":[145,167,378],"by":[146,193],"iteratively":[147,179],"selecting":[148],"vertex":[150],"highest":[153],"degree.Input: G -":[154],"Input":[155],"graph.Output: Graph":[156],"updated":[158],"node":[159,267,274,312],"attributes":[160,176,219],"indicating":[161],"set.approximate_cer(G)Implements":[164],"calculate":[169],"an":[170,221],"approximate":[171],"set.Steps:Resets":[174],"using reset_graph.Selects":[177],"based":[180,269],"\"power\"":[183],"metric":[184],"until":[185],"all":[186,342],"dominated.Minimizes":[189],"removing":[194],"redundant":[195],"nodes.Output: Size":[196],"set.double_domination(T)Computes":[201],"combination":[208],"CFDS":[212],"(Certified":[213],"From":[214],"Set)":[216],"approaches.Steps:Resets":[217],"with basic_reset.Computes":[220],"initial":[222],"using greedy_dominating_set.Refines":[225],"using construct_CFDS.Output: A":[229],"list":[230],"containing":[231],"size":[233,310],"sub-steps.linear_Trees(T)Processes":[244],"phases":[249],"determine":[251],"its":[252],"minimal":[253,283],"linear":[257],"algorithms.Phases:Phase":[259],"0: Classifies":[260],"into":[262],"leaves":[263],"supports.Phase":[265],"1: Adjusts":[266],"states":[268,275],"neighbors.Phase":[271],"22: Further":[272],"refines":[273],"ensure":[277],"domination.Output: Count":[278],"set.test_algorithms(start_n,":[285],"end_n,":[286],"step_n,":[287],"output_file)Tests":[288],"implemented":[290],"sizes":[296],"records":[298],"results.Inputs:start_n -":[300],"Initial":[301],"nodes.end_n -":[304],"Final":[305],"nodes.step_n -":[308],"Step":[309],"count":[313],"increment.output_file -":[314],"Path":[315],"save":[317],"results.Output: A":[319],"containing:Graph":[322],"size.Results":[323],"`linear_Trees`":[325],"`approximate_cer`.Execution":[327],"algorithms.is_dominating(G,":[331],"D)Validates":[332],"whether":[333],"given":[335],"set D is":[336],"graph G.Output: TRUE if":[341],"dominated, FALSE otherwise.ResultsThe":[345],"experiments":[349],"following":[358],"columns:n: Number":[359],"graph.lTrees: Result":[364],"from":[365,367],"the linear_Trees algorithm.approx: Result":[366],"the approximate_cer algorithm.approx_double_with_greedy: Size":[368],"set.Execution":[373],"times: Times":[374],"recorded":[375],"each":[377],"step.":[380]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}