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...
Uloženo v:
| Vydáno v: | Operations research and decisions Ročník 30; číslo 1; s. 5 - 24 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Wrocław University of Science and Technology
2020
|
| ISSN: | 2081-8858, 2391-6060 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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 |