scientific article; zbMATH DE number 1088276
From MaRDI portal
Publication:4364592
Cited in
(5)- A selected tour of the theory of identification matrices
- Optimal computation of shortest paths on doubly convex bipartite graphs
- Identification and the Information Matrix: How to Get Just Sufficiently Rich?
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364592)