抄録
Sabotage games on a graph involve Runner who wants to travel between two given vertices and Blocker who aims to prevent Runner from arriving at his destination by destroying edges. This paper completely characterizes games with multiple destinations on weighted trees for both local and global cutting rules of arbitrary capacity. The games on weighted graphs are characterized using the tree unraveling of the graph.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 250-254 |
| ページ数 | 5 |
| ジャーナル | Operations Research Letters |
| 巻 | 44 |
| 号 | 2 |
| DOI | |
| 出版ステータス | Published - 2016 3月 |
| 外部発表 | はい |
ASJC Scopus subject areas
- ソフトウェア
- 経営科学およびオペレーションズ リサーチ
- 産業および生産工学
- 応用数学