Nazanin Abbasnezhad, Javad MEHRI-TAKMEH, J. Vakili
{"title":"随着时间的推移，其支配地位及其离散化","authors":"Nazanin Abbasnezhad, Javad MEHRI-TAKMEH, J. Vakili","doi":"10.37190/ord200101","DOIUrl":null,"url":null,"abstract":"Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.","PeriodicalId":43244,"journal":{"name":"Operations Research and Decisions","volume":"50 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The domination over time and its discretisation\",\"authors\":\"Nazanin Abbasnezhad, Javad MEHRI-TAKMEH, J. Vakili\",\"doi\":\"10.37190/ord200101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.\",\"PeriodicalId\":43244,\"journal\":{\"name\":\"Operations Research and Decisions\",\"volume\":\"50 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research and Decisions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37190/ord200101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research and Decisions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37190/ord200101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
