An algorithm for the enumeration of spanning trees

DOI10.1007/BF01939361zbMath0602.68054OpenAlexW2006156823MaRDI QIDQ1082082

Pawel Winter

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01939361

zbMATH Keywords

time complexitycontractionsspace complexityenumeration algorithmspanning trees of an undirected graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A pivot Gray code listing for the spanning trees of the fan graph ⋮ Edge-matching graph contractions and their interlacing properties ⋮ Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph

Cites Work

• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Finding All Spanning Trees of Directed and Undirected Graphs
• Gravitational instability and collapse of charged fluid shells
• Unnamed Item

This page was built for publication: An algorithm for the enumeration of spanning trees