Pages that link to "Item:Q2331598"
From MaRDI portal
The following pages link to Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598):
Displaying 4 items.
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- The maximum number of spanning trees of a graph with given matching number (Q2239004) (← links)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)
