{"id":"https://openalex.org/W2306000054","doi":"https://doi.org/10.1109/comsnets.2016.7439959","title":"Permanent dominating set on dynamic graphs","display_name":"Permanent dominating set on dynamic graphs","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2306000054","doi":"https://doi.org/10.1109/comsnets.2016.7439959","mag":"2306000054"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2016.7439959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2016.7439959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","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/A5013625305","display_name":"Subhrangsu Mandal","orcid":"https://orcid.org/0000-0002-0957-492X"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Subhrangsu Mandal","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India","Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111977677","display_name":"Arobinda Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arobinda Gupta","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India","Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013625305"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01633276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9940999746322632,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9940999746322632,"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.9918000102043152,"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.9853000044822693,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6148703694343567},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5719272494316101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5505675077438354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5339566469192505},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.49348604679107666},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47571736574172974},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.47497791051864624},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4283842444419861},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4253835380077362},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4174894690513611},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38879072666168213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3664502501487732},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3472277522087097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32202982902526855},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.25856542587280273},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.215948224067688},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.09041067957878113}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6148703694343567},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5719272494316101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5505675077438354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5339566469192505},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.49348604679107666},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47571736574172974},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.47497791051864624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4283842444419861},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4253835380077362},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4174894690513611},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38879072666168213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3664502501487732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3472277522087097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32202982902526855},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.25856542587280273},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.215948224067688},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.09041067957878113},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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.1109/comsnets.2016.7439959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2016.7439959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1970700632","https://openalex.org/W2120741723","https://openalex.org/W2792129212","https://openalex.org/W4236642833"],"related_works":["https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W2155984879","https://openalex.org/W1483891445","https://openalex.org/W2388345276","https://openalex.org/W2391238671","https://openalex.org/W1530712874","https://openalex.org/W3047117384","https://openalex.org/W4242849573","https://openalex.org/W2007607373"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,12,18],"greedy":[3],"approximation":[4],"algorithm":[5,61],"to":[6],"solve":[7],"the":[8,24,32,39,46,50,53,69,76,79],"problem":[9],"of":[10,31,52,71,78],"finding":[11],"minimum":[13],"permanent":[14],"dominating":[15],"set":[16,30,41],"for":[17],"given":[19],"dynamic":[20,33,54,80],"graph":[21,34,55],"represented":[22],"using":[23],"evolving":[25],"graphs":[26],"model.":[27],"The":[28,59],"node":[29],"is":[35,56,62,68,75],"static":[36],"and":[37,73],"only":[38],"edge":[40],"changes":[42],"with":[43],"time.":[44],"All":[45],"change":[47],"information":[48],"over":[49],"lifetime":[51,77],"known":[57],"apriori.":[58],"proposed":[60],"an":[63],"O(ln(n\u03c4))-approximation":[64],"algorithm,":[65],"where":[66],"n":[67],"number":[70],"nodes":[72],"\u03c4":[74],"graph.":[81]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}