• DOI:10.1109/TNSE.2019.2948474
Corpus ID: 53278650

Observability Properties of Colored Graphs

@article{Chilenski2020ObservabilityPO,
  title={Observability Properties of Colored Graphs},
  author={M. Chilenski and G. Cybenko and I. Dekine and P. Kumar and G. Raz},
  journal={IEEE Transactions on Network Science and Engineering},
  year={2020},
  volume={7},
  pages={1687-1696}
}

• M. Chilenski, G. Cybenko, +2 authors G. Raz
• Published 2020
• Computer Science, Mathematics
• IEEE Transactions on Network Science and Engineering

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes were visited earlier in the traversal. Previous research efforts have identified several different notions of observability as well as the associated properties of graphs for which… Expand

View on IEEE

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed