A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs

Abstract

In this paper we propose an algorithm for generating all the spanning trees in undirected graphs. The algorithm requires O (n+m+ τ n) time where the given graph has n vertices, m edges, and τ spanning trees. For outputting all the spanning trees explicitly, this time complexity is optimal. Our algorithm follows a special rooted tree structure on the… (More)
DOI: 10.1007/PL00009171

Topics

  • Presentations referencing similar topics