Observable graphs

DOI10.1016/J.DAM.2011.02.009MaRDI QIDQ548270zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmobservabilityautonomous agentscolored graphsobservable graphspartly observable graphstrackable graphs

Mathematics Subject Classification ID

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)

Recommendations

• Observability of lattice graphs
• scientific article; zbMATH DE number 907924
• scientific article; zbMATH DE number 844141
• Landmarks in graphs
• Asymptotic behaviour of the observability of \(Q_ n\)

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Efficient algorithms for deciding the type of growth of products of integer matrices
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Hidden Markov processes
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Observability of discrete event dynamic systems

Cited in

(4)

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

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)