Pages that link to "Item:Q655852"
From MaRDI portal
The following pages link to Minimum congestion spanning trees in bipartite and random graphs (Q655852):
Displaying 6 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Spanning tree congestion of rook's graphs (Q2906358) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)