Observable graphs

DOI10.1016/J.DAM.2011.02.009zbMath1218.05048OpenAlexW2911394596MaRDI QIDQ548270

Raphaël M. Jungers, Blondel, Vincent D.

Publication date: 28 June 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.02.009

zbMATH Keywords

algorithmobservabilityautonomous agentscolored graphsobservable graphspartly observable graphstrackable graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Observability of Boolean networks: a graph-theoretic approach ⋮ Observability of lattice graphs ⋮ Trajectory detectability of discrete-event systems

Cites Work

• Unnamed Item
• Efficient algorithms for deciding the type of growth of products of integer matrices
• Observability of discrete event dynamic systems
• Hidden Markov processes
• An Introduction to Symbolic Dynamics and Coding
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

This page was built for publication: Observable graphs