共 50 条
- [1] An algorithm for enumerating all directed spanning trees in a directed graph [J]. ALGORITHMS AND COMPUTATION, 1996, 1178 : 166 - 173
- [3] Faster enumeration of all spanning trees of a directed graph [J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 428 - 439
- [4] Enumerating spanning trees of a graph with edge constraints [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 87 : 357 - 364
- [6] Finding All Breadth First Full Spanning Trees in a Directed Graph [J]. 2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 2, 2017, : 372 - 377