Efficient algorithms for determining an extremal tree of a graph
- 1 October 1973
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 12-15
- https://doi.org/10.1109/swat.1973.6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- An implemented graph algorithm for winning Shannon Switching GamesCommunications of the ACM, 1972
- Topological degrees of freedom and mixed analysis of electrical networksIEEE Transactions on Circuit Theory, 1970
- Maximally Distant Trees and Principal Partition of a Linear GraphIEEE Transactions on Circuit Theory, 1969
- A Solution of the Shannon Switching GameJournal of the Society for Industrial and Applied Mathematics, 1964