Pages that link to "Item:Q855940"
From MaRDI portal
The following pages link to Heuristic maximization of the number of spanning trees in regular graphs (Q855940):
Displaying 4 items.
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs (Q1840930) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- Maximizing the number of spanning trees of networks based on cycle basis representation (Q3828018) (← links)
- Maximizing spanning trees in almost complete graphs (Q4355482) (← links)