The domination over time and its discretisation

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 pr...

Full description

Saved in:
Bibliographic Details
Published inOperations research and decisions Vol. 30; no. 1; pp. 5 - 24
Main Authors Abbasnezhad, Nazanin, Mehri-Takmeh, Javad, Vakili, Javad
Format Journal Article
LanguageEnglish
Published Wrocław University of Science and Technology 2020
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2081-8858
2391-6060
DOI:10.37190/ord200101