1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2022
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
Ben Cameron, Aaron Grubb, Joe Sawada
We consider the problem of listing all spanning trees of a graph such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a "pivot…
cs.DS2021★ 1 cited
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
Ben Cameron, Aaron Grubb, Joe Sawada
We use a greedy strategy to list the spanning trees of the fan graph, , such that successive trees differ by pivoting a single edge around a vertex. It is the first greedy alg…