Antagonistic Graph Coloring Under Uncertainty

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2018
Accession Number
AD1062975

Entities

People

  • Jeffrey P. Kharoufeh

Organizations

  • University of Pittsburgh

Tags

Communities of Interest

  • Cyber
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Computer Simulations
  • Cybersecurity
  • Failure Mode And Effect Analysis
  • Government Procurement
  • Governments
  • Information Exchange
  • Mathematical Models
  • Models
  • Probability
  • Random Variables
  • Simulations
  • Social Networks
  • Systems Biology
  • Uncertainty

Readers

  • Cybersecurity.
  • Operations Research
  • Theoretical Analysis.

Technology Areas

  • Cyber
  • Cyber - Cryptography