Antagonistic Graph Coloring Under Uncertainty
Technical Report,01 Feb 2017,31 May 2018
University of Pittsburgh Pittsburgh United States
Pagination or Media Count:
The primary objective of this research is to determine optimal, or near-optimal, ways of identifying a subset of nodes of interest in a graph and then coloring those nodes, subject to a time constraint. The term coloring is general and can be interpreted to mean that we alter the binary status of a node. For example, biological systems may be moved between healthy and infected states, physical systems between working and failed, social systems between organic and influenced, and digital systems between functioning and corrupt. Consequently, this work is applicable to many problems in epidemiology, warfare, influencing social networks and cybersecurity.
- Statistics and Probability
- Operations Research