scientific article; zbMATH DE number 3194440
From MaRDI portal
Publication:5730799
Cited in
(9)- On enumerating paths of K arcs in unoriented complete graphs
- Analysis and synthesis of resistive n-port networks
- Generating formulas for the number of trees in a graph
- On Okada's method for realizing cut-set matrices
- Optimization of communication nets with switching
- Optimum flows in general communication networks
- Estimation of terminal capacity in probabilistic communication nets
- Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter
- Efficiently enumerating spanning trees of k-trees
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 Q5730799)
