Pages that link to "Item:Q5248999"
From MaRDI portal
The following pages link to A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (Q5248999):
Displayed 8 items.
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)