Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- 1 July 1975
- Vol. 5 (3) , 237-252
- https://doi.org/10.1002/net.1975.5.3.237
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Algorithm 354: generator of spanning trees [H]Communications of the ACM, 1969
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- Generation of Trees without DuplicationsIEEE Transactions on Circuit Theory, 1965
- A Simple Algorithm for Listing All the Trees of a GraphIEEE Transactions on Circuit Theory, 1965
- Generation and Realization of Trees and k-TreesIEEE Transactions on Circuit Theory, 1964
- Ueber Stromverzweigung in netzförmigen LeiternAnnalen der Physik, 1902