scientific article; zbMATH DE number 3845622
From MaRDI portal
Publication:3315547
[For the entire collection see Zbl 0499.00005.] The author considers the method in the title [\textit{B. A. Carré,} Graphs and networks (1979; Zbl 0455.05001)] as a decomposition of the original matrix of the problem in two triangle-matrices. The obtained result is a generalisation of the results of \textit{B. A. Carré} [An algebra for network routing problems, J. Inst. Math. Appl. 7, 273-294 (1971)] and \textit{R. C. Backhouse} and \textit{B. A. Carré} [J. Inst. Math. Appl. 15, 161-186 (1975; Zbl 0304.68082)].
Recommendations
Cited in
(4)- An iterative algorithm to determine the number of time steps in path generation methods
- scientific article; zbMATH DE number 1204366 (Why is no real title available?)
- ECO method and hill-free generalized Motzkin paths
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
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 Q3315547)