Listing all the minimum spanning trees in an undirected graph

DOI10.1080/00207160903329699zbMath1214.05167OpenAlexW2058363692MaRDI QIDQ3066964

Kohtaro Watanabe, Seiji Kataoka, Takeo Yamada

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903329699

zbMATH Keywords

minimum spanning treeenumeration algorithm

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Unnamed Item ⋮ Efficiently enumerating minimal triangulations

This page was built for publication: Listing all the minimum spanning trees in an undirected graph