Observable Graphs

  title={Observable Graphs},
  author={Rapha{\"e}l M. Jungers and Vincent D. Blondel},
  journal={Discrete Applied Mathematics},
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his position only from time to time, the graph is said to be partly observable. Observability in graphs is desirable in situations where autonomous agents are moving on a network and one wants to localize them (or the agent wants to localize himself) with limited… CONTINUE READING
3 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-3 of 3 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

Codage symbolique

  • M.-P. Beal
  • 1993
2 Excerpts

Viterbi . Error bounds for convolutional codes and an asymptotically optimal decoding algorithm

  • J. A.
  • IEEE Transaction on Information Theory , IT -
  • 1967

Similar Papers

Loading similar papers…