{"id":"https://openalex.org/W4223589371","doi":"https://doi.org/10.1142/s179383092250080x","title":"Progress on fault-tolerant locating-dominating sets","display_name":"Progress on fault-tolerant locating-dominating sets","publication_year":2022,"publication_date":"2022-04-11","ids":{"openalex":"https://openalex.org/W4223589371","doi":"https://doi.org/10.1142/s179383092250080x"},"language":"en","primary_location":{"id":"doi:10.1142/s179383092250080x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250080x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5018888180","display_name":"Devin Jean","orcid":"https://orcid.org/0000-0001-9549-2324"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Devin C. Jean","raw_affiliation_strings":["Computer Science Department, Vanderbilt University, USA"],"raw_orcid":"https://orcid.org/0000-0001-9549-2324","affiliations":[{"raw_affiliation_string":"Computer Science Department, Vanderbilt University, USA","institution_ids":["https://openalex.org/I200719446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057007668","display_name":"Suk J. Seo","orcid":"https://orcid.org/0000-0003-3859-3449"},"institutions":[{"id":"https://openalex.org/I169615421","display_name":"Middle Tennessee State University","ror":"https://ror.org/02n1hzn07","country_code":"US","type":"education","lineage":["https://openalex.org/I169615421"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suk J. Seo","raw_affiliation_strings":["Computer Science Department, Middle Tennessee State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Middle Tennessee State University, USA","institution_ids":["https://openalex.org/I169615421"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018888180"],"corresponding_institution_ids":["https://openalex.org/I200719446"],"apc_list":null,"apc_paid":null,"fwci":0.428,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61943625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"02","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9965000152587891,"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/T11478","display_name":"Caching and Content Delivery","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/dominating-set","display_name":"Dominating set","score":0.7306661605834961},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5709993243217468},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5420520901679993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5221453309059143},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4924832284450531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4838044047355652},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45852911472320557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4418042302131653},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.4403533935546875},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.05026969313621521}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7306661605834961},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5709993243217468},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5420520901679993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5221453309059143},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4924832284450531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4838044047355652},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45852911472320557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4418042302131653},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.4403533935546875},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.05026969313621521},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383092250080x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250080x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W333466434","https://openalex.org/W2006716595","https://openalex.org/W2011039300","https://openalex.org/W2056725088","https://openalex.org/W2061929670","https://openalex.org/W2068262188","https://openalex.org/W2094351242","https://openalex.org/W2100994793","https://openalex.org/W2556224564","https://openalex.org/W2576165129","https://openalex.org/W2578057204","https://openalex.org/W2917172636","https://openalex.org/W3013983348","https://openalex.org/W3123848407"],"related_works":["https://openalex.org/W2662701","https://openalex.org/W2357985373","https://openalex.org/W2054473698","https://openalex.org/W2370165438","https://openalex.org/W1868459378","https://openalex.org/W2761571700","https://openalex.org/W1966029840","https://openalex.org/W4384157409","https://openalex.org/W2009561209","https://openalex.org/W2002336872"],"abstract_inverted_index":{"A":[0],"locating-dominating":[1,42,46],"set":[2,103],"is":[3,107,119],"a":[4,11,38,101],"subset":[5],"of":[6,41,57,72,95,100,131],"vertices":[7],"representing":[8],"\u201cdetectors\u201d":[9],"in":[10,63,69,104,116],"graph":[12],"G":[13],"which":[14,49],"can":[15,28,50],"locate":[16],"an":[17,128],"\u201cintruder\u201d":[18],"given":[19],"that":[20,92,112],"each":[21],"detector":[22],"covers":[23],"its":[24,30,34],"closed":[25],"neighborhood":[26],"and":[27,86,125],"distinguish":[29],"own":[31],"location":[32],"from":[33],"neighbors.":[35],"We":[36,90],"explore":[37],"fault-tolerant":[39],"variant":[40],"sets,":[43,48],"called":[44],"error-detecting":[45],"(DET:LD)":[47],"tolerate":[51],"one":[52],"false":[53],"negative.":[54],"The":[55],"concept":[56],"DET:LD":[58,81,102],"sets":[59,82],"was":[60],"originally":[61],"introduced":[62],"2002,":[64],"along":[65],"with":[66],"several":[67],"properties":[68],"various":[70],"classes":[71],"graphs;":[73],"we":[74,110,126],"extend":[75],"this":[76,135],"work":[77],"by":[78],"fully":[79],"characterizing":[80],"for":[83],"general":[84],"graphs":[85,106,118,133],"establishing":[87],"existence":[88],"criteria.":[89],"prove":[91],"the":[93,97,113],"problem":[94],"determining":[96],"minimum":[98,114],"density":[99,115],"arbitrary":[105],"NP-complete.":[108],"Additionally,":[109],"determine":[111],"cubic":[117,132],"at":[120],"least":[121],"[Formula:":[122],"see":[123],"text],":[124],"show":[127],"infinite":[129],"family":[130],"achieving":[134],"density.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}