An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs

This publication has 8 references indexed in Scilit:

• Reverse search for enumeration
  Discrete Applied Mathematics, 1996
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
  SIAM Journal on Computing, 1995
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
  Discrete & Computational Geometry, 1992
• A basis enumeration algorithm for linear systems with geometric applications
  Applied Mathematics Letters, 1991
• Finding All Spanning Trees of Directed and Undirected Graphs
  SIAM Journal on Computing, 1978
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
  Networks, 1975
• Depth-First Search and Linear Graph Algorithms
  SIAM Journal on Computing, 1972
• A Simple Algorithm for Listing All the Trees of a Graph
  IEEE Transactions on Circuit Theory, 1965