Observable graphs
DOI10.1016/J.DAM.2011.02.009zbMATH Open1218.05048OpenAlexW2911394596MaRDI QIDQ548270FDOQ548270
Authors: Raphaël M. Jungers, Vincent D. Blondel
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
Recommendations
algorithmobservabilityautonomous agentscolored graphsobservable graphspartly observable graphstrackable graphs
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Cites Work
- Hidden Markov processes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Efficient algorithms for deciding the type of growth of products of integer matrices
- An Introduction to Symbolic Dynamics and Coding
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Observability of discrete event dynamic systems
Cited In (4)
This page was built for publication: Observable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548270)